./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:26:06,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:26:06,660 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:26:06,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:26:06,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:26:06,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:26:06,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:26:06,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:26:06,684 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:26:06,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:26:06,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:26:06,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:26:06,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:26:06,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:26:06,688 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:26:06,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:26:06,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:26:06,689 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:26:06,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:26:06,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:26:06,690 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:26:06,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:26:06,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:26:06,693 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:26:06,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:26:06,694 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:26:06,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:26:06,694 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:26:06,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:26:06,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:26:06,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:26:06,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:26:06,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:06,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:26:06,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:26:06,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:26:06,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:26:06,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:26:06,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:26:06,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:26:06,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:26:06,698 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:26:06,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 [2024-11-12 03:26:06,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:26:06,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:26:06,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:26:06,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:26:06,923 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:26:06,924 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-11-12 03:26:08,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:26:08,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:26:08,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-11-12 03:26:08,652 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812735888/4dc0f5611a8b4e6d80db787840637171/FLAGbd79618d0 [2024-11-12 03:26:08,670 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/812735888/4dc0f5611a8b4e6d80db787840637171 [2024-11-12 03:26:08,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:26:08,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:26:08,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:08,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:26:08,694 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:26:08,695 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:08" (1/1) ... [2024-11-12 03:26:08,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c30f79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:08, skipping insertion in model container [2024-11-12 03:26:08,696 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:08" (1/1) ... [2024-11-12 03:26:08,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:26:08,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-11-12 03:26:08,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:09,000 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:26:09,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-11-12 03:26:09,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:09,053 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:26:09,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09 WrapperNode [2024-11-12 03:26:09,053 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:09,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:09,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:26:09,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:26:09,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,074 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,115 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-11-12 03:26:09,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:09,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:26:09,120 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:26:09,120 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:26:09,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:26:09,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:26:09,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:26:09,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:26:09,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:26:09,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (1/1) ... [2024-11-12 03:26:09,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:09,302 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:26:09,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:26:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:26:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:26:09,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:26:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:26:09,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:26:09,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:26:09,437 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:26:09,439 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:26:09,769 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 03:26:09,770 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:26:09,785 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:26:09,786 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:26:09,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:09 BoogieIcfgContainer [2024-11-12 03:26:09,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:26:09,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:26:09,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:26:09,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:26:09,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:26:08" (1/3) ... [2024-11-12 03:26:09,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13baf366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:09, skipping insertion in model container [2024-11-12 03:26:09,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:09" (2/3) ... [2024-11-12 03:26:09,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13baf366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:09, skipping insertion in model container [2024-11-12 03:26:09,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:09" (3/3) ... [2024-11-12 03:26:09,793 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-11-12 03:26:09,805 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:26:09,805 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:26:09,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:26:09,867 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e367473, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:26:09,871 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:26:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 81 states have internal predecessors, (121), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:26:09,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 03:26:09,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:09,894 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:09,895 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:09,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:09,901 INFO L85 PathProgramCache]: Analyzing trace with hash 905014065, now seen corresponding path program 1 times [2024-11-12 03:26:09,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:09,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648408779] [2024-11-12 03:26:09,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:09,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:10,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:10,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:26:10,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648408779] [2024-11-12 03:26:10,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648408779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:10,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:10,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:26:10,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620944415] [2024-11-12 03:26:10,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:10,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:26:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:10,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:26:10,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:26:10,275 INFO L87 Difference]: Start difference. First operand has 107 states, 80 states have (on average 1.5125) internal successors, (121), 81 states have internal predecessors, (121), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:26:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:10,305 INFO L93 Difference]: Finished difference Result 206 states and 355 transitions. [2024-11-12 03:26:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:26:10,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2024-11-12 03:26:10,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:10,314 INFO L225 Difference]: With dead ends: 206 [2024-11-12 03:26:10,314 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 03:26:10,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:26:10,321 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:10,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:26:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 03:26:10,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-12 03:26:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4605263157894737) internal successors, (111), 76 states have internal predecessors, (111), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:26:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2024-11-12 03:26:10,362 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 164 [2024-11-12 03:26:10,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:10,363 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2024-11-12 03:26:10,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:26:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2024-11-12 03:26:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-12 03:26:10,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:10,367 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:10,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:26:10,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:10,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:10,368 INFO L85 PathProgramCache]: Analyzing trace with hash 169915967, now seen corresponding path program 1 times [2024-11-12 03:26:10,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:10,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958328911] [2024-11-12 03:26:10,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:10,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:26:10,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:10,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958328911] [2024-11-12 03:26:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958328911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:10,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:26:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842649119] [2024-11-12 03:26:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:10,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:26:10,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:10,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:26:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:10,764 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:10,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:10,942 INFO L93 Difference]: Finished difference Result 290 states and 457 transitions. [2024-11-12 03:26:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:26:10,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-12 03:26:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:10,949 INFO L225 Difference]: With dead ends: 290 [2024-11-12 03:26:10,949 INFO L226 Difference]: Without dead ends: 191 [2024-11-12 03:26:10,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:10,953 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 127 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:10,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 324 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:26:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-12 03:26:10,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2024-11-12 03:26:10,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 131 states have internal predecessors, (180), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:26:10,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 276 transitions. [2024-11-12 03:26:10,988 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 276 transitions. Word has length 165 [2024-11-12 03:26:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:10,993 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 276 transitions. [2024-11-12 03:26:10,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:10,993 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 276 transitions. [2024-11-12 03:26:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-12 03:26:10,996 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:10,996 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:10,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:26:10,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:10,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:10,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1105854815, now seen corresponding path program 1 times [2024-11-12 03:26:10,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:10,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550826949] [2024-11-12 03:26:10,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:11,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:26:11,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:11,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550826949] [2024-11-12 03:26:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550826949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:11,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:11,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:26:11,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291791629] [2024-11-12 03:26:11,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:11,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:26:11,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:11,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:26:11,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:11,349 INFO L87 Difference]: Start difference. First operand 182 states and 276 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:11,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:11,445 INFO L93 Difference]: Finished difference Result 418 states and 639 transitions. [2024-11-12 03:26:11,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:26:11,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-11-12 03:26:11,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:11,452 INFO L225 Difference]: With dead ends: 418 [2024-11-12 03:26:11,452 INFO L226 Difference]: Without dead ends: 239 [2024-11-12 03:26:11,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:11,455 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 46 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:11,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 263 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:26:11,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-12 03:26:11,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 229. [2024-11-12 03:26:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 153 states have (on average 1.326797385620915) internal successors, (203), 153 states have internal predecessors, (203), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 03:26:11,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 347 transitions. [2024-11-12 03:26:11,501 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 347 transitions. Word has length 166 [2024-11-12 03:26:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:11,502 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 347 transitions. [2024-11-12 03:26:11,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:11,502 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 347 transitions. [2024-11-12 03:26:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:26:11,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:11,508 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:11,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:26:11,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:11,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:11,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1860998904, now seen corresponding path program 1 times [2024-11-12 03:26:11,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:11,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736399720] [2024-11-12 03:26:11,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:11,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:11,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:26:11,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:11,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736399720] [2024-11-12 03:26:11,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736399720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:11,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:11,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:26:11,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979735656] [2024-11-12 03:26:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:11,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:26:11,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:11,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:26:11,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:11,725 INFO L87 Difference]: Start difference. First operand 229 states and 347 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:11,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:11,757 INFO L93 Difference]: Finished difference Result 408 states and 620 transitions. [2024-11-12 03:26:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:26:11,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-12 03:26:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:11,760 INFO L225 Difference]: With dead ends: 408 [2024-11-12 03:26:11,761 INFO L226 Difference]: Without dead ends: 229 [2024-11-12 03:26:11,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:11,767 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:11,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:26:11,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-12 03:26:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-12 03:26:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 153 states have (on average 1.3202614379084967) internal successors, (202), 153 states have internal predecessors, (202), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 03:26:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 346 transitions. [2024-11-12 03:26:11,804 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 346 transitions. Word has length 167 [2024-11-12 03:26:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:11,804 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 346 transitions. [2024-11-12 03:26:11,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 346 transitions. [2024-11-12 03:26:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-12 03:26:11,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:11,808 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:11,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:26:11,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:11,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash -553634034, now seen corresponding path program 1 times [2024-11-12 03:26:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234511829] [2024-11-12 03:26:11,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:11,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:11,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:12,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:26:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234511829] [2024-11-12 03:26:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234511829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:12,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:12,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:26:12,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935680189] [2024-11-12 03:26:12,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:12,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:26:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:12,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:26:12,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:12,029 INFO L87 Difference]: Start difference. First operand 229 states and 346 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:12,094 INFO L93 Difference]: Finished difference Result 408 states and 618 transitions. [2024-11-12 03:26:12,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:26:12,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-12 03:26:12,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:12,096 INFO L225 Difference]: With dead ends: 408 [2024-11-12 03:26:12,096 INFO L226 Difference]: Without dead ends: 229 [2024-11-12 03:26:12,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:26:12,097 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:12,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 268 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:26:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-12 03:26:12,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-12 03:26:12,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 153 states have (on average 1.3137254901960784) internal successors, (201), 153 states have internal predecessors, (201), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 03:26:12,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 345 transitions. [2024-11-12 03:26:12,109 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 345 transitions. Word has length 167 [2024-11-12 03:26:12,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:12,109 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 345 transitions. [2024-11-12 03:26:12,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 345 transitions. [2024-11-12 03:26:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:26:12,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:12,111 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:12,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:26:12,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:12,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:12,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1657251684, now seen corresponding path program 1 times [2024-11-12 03:26:12,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:12,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192652585] [2024-11-12 03:26:12,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:12,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:26:12,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:12,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192652585] [2024-11-12 03:26:12,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192652585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:26:12,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855370761] [2024-11-12 03:26:12,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:12,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:26:12,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:12,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:26:12,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:26:12,385 INFO L87 Difference]: Start difference. First operand 229 states and 345 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:12,840 INFO L93 Difference]: Finished difference Result 592 states and 899 transitions. [2024-11-12 03:26:12,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:26:12,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-12 03:26:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:12,846 INFO L225 Difference]: With dead ends: 592 [2024-11-12 03:26:12,846 INFO L226 Difference]: Without dead ends: 413 [2024-11-12 03:26:12,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 03:26:12,847 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 384 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:12,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 570 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 03:26:12,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-12 03:26:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 389. [2024-11-12 03:26:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 271 states have (on average 1.3284132841328413) internal successors, (360), 272 states have internal predecessors, (360), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-12 03:26:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 582 transitions. [2024-11-12 03:26:12,923 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 582 transitions. Word has length 168 [2024-11-12 03:26:12,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:12,923 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 582 transitions. [2024-11-12 03:26:12,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 582 transitions. [2024-11-12 03:26:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 03:26:12,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:12,926 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:12,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 03:26:12,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:12,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1279919834, now seen corresponding path program 1 times [2024-11-12 03:26:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:12,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487177256] [2024-11-12 03:26:12,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:12,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:12,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:13,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-12 03:26:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487177256] [2024-11-12 03:26:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487177256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:13,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:26:13,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936749590] [2024-11-12 03:26:13,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:13,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:26:13,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:13,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:26:13,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:26:13,348 INFO L87 Difference]: Start difference. First operand 389 states and 582 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:14,222 INFO L93 Difference]: Finished difference Result 730 states and 1097 transitions. [2024-11-12 03:26:14,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 03:26:14,223 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-12 03:26:14,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:14,226 INFO L225 Difference]: With dead ends: 730 [2024-11-12 03:26:14,226 INFO L226 Difference]: Without dead ends: 414 [2024-11-12 03:26:14,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-12 03:26:14,228 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 349 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:14,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 804 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 03:26:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-12 03:26:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 390. [2024-11-12 03:26:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 272 states have (on average 1.3235294117647058) internal successors, (360), 273 states have internal predecessors, (360), 111 states have call successors, (111), 6 states have call predecessors, (111), 6 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-12 03:26:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 582 transitions. [2024-11-12 03:26:14,285 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 582 transitions. Word has length 168 [2024-11-12 03:26:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:14,286 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 582 transitions. [2024-11-12 03:26:14,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-12 03:26:14,286 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 582 transitions. [2024-11-12 03:26:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 03:26:14,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:14,288 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:14,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 03:26:14,288 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:14,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:14,288 INFO L85 PathProgramCache]: Analyzing trace with hash -241156302, now seen corresponding path program 1 times [2024-11-12 03:26:14,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:14,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596357804] [2024-11-12 03:26:14,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:14,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:26:14,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:14,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596357804] [2024-11-12 03:26:14,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596357804] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:26:14,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294273463] [2024-11-12 03:26:14,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:14,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:14,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:14,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:26:14,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 03:26:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:14,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 03:26:14,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-12 03:26:15,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:26:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:26:15,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294273463] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:26:15,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:26:15,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2024-11-12 03:26:15,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799774410] [2024-11-12 03:26:15,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:26:15,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 03:26:15,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:15,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 03:26:15,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-12 03:26:15,773 INFO L87 Difference]: Start difference. First operand 390 states and 582 transitions. Second operand has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-11-12 03:26:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:16,500 INFO L93 Difference]: Finished difference Result 610 states and 901 transitions. [2024-11-12 03:26:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 03:26:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 169 [2024-11-12 03:26:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:16,504 INFO L225 Difference]: With dead ends: 610 [2024-11-12 03:26:16,504 INFO L226 Difference]: Without dead ends: 289 [2024-11-12 03:26:16,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2024-11-12 03:26:16,507 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 350 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:16,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 538 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:26:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-12 03:26:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 167. [2024-11-12 03:26:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.2321428571428572) internal successors, (138), 112 states have internal predecessors, (138), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:26:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2024-11-12 03:26:16,548 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 234 transitions. Word has length 169 [2024-11-12 03:26:16,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:16,549 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 234 transitions. [2024-11-12 03:26:16,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.4375) internal successors, (119), 16 states have internal predecessors, (119), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-11-12 03:26:16,549 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 234 transitions. [2024-11-12 03:26:16,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-12 03:26:16,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:16,551 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:16,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 03:26:16,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:16,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:16,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:16,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1374202249, now seen corresponding path program 1 times [2024-11-12 03:26:16,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:16,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146130369] [2024-11-12 03:26:16,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:16,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 03:26:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 03:26:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 03:26:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 03:26:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 03:26:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 03:26:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 03:26:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 03:26:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 03:26:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 03:26:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 03:26:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 03:26:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 03:26:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-12 03:26:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 03:26:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 03:26:17,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 03:26:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 03:26:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 03:26:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 03:26:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 03:26:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 03:26:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 03:26:17,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:26:17,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146130369] [2024-11-12 03:26:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146130369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:26:17,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547212600] [2024-11-12 03:26:17,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:17,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:17,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:17,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:26:17,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 03:26:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:17,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 03:26:17,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:17,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-12 03:26:17,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:26:17,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-12 03:26:17,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547212600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:26:17,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:26:17,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2024-11-12 03:26:17,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722935847] [2024-11-12 03:26:17,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:26:17,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 03:26:17,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:17,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 03:26:17,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2024-11-12 03:26:17,818 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-12 03:26:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:18,751 INFO L93 Difference]: Finished difference Result 293 states and 411 transitions. [2024-11-12 03:26:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 03:26:18,751 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 170 [2024-11-12 03:26:18,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:18,753 INFO L225 Difference]: With dead ends: 293 [2024-11-12 03:26:18,753 INFO L226 Difference]: Without dead ends: 185 [2024-11-12 03:26:18,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=522, Unknown=0, NotChecked=0, Total=702 [2024-11-12 03:26:18,755 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 460 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:18,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 764 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 03:26:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-12 03:26:18,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 167. [2024-11-12 03:26:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 112 states have (on average 1.2232142857142858) internal successors, (137), 112 states have internal predecessors, (137), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-12 03:26:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 233 transitions. [2024-11-12 03:26:18,779 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 233 transitions. Word has length 170 [2024-11-12 03:26:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:18,779 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 233 transitions. [2024-11-12 03:26:18,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-12 03:26:18,779 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 233 transitions. [2024-11-12 03:26:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-12 03:26:18,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:18,781 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:18,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 03:26:18,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-12 03:26:18,983 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:18,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -959858048, now seen corresponding path program 1 times [2024-11-12 03:26:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867632843] [2024-11-12 03:26:18,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:26:19,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [646950548] [2024-11-12 03:26:19,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:19,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:19,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:19,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:26:19,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 03:26:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:26:19,424 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:26:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:26:19,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:26:19,544 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:26:19,545 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:26:19,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 03:26:19,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:19,749 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:19,821 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:26:19,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:26:19 BoogieIcfgContainer [2024-11-12 03:26:19,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:26:19,824 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:26:19,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:26:19,824 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:26:19,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:09" (3/4) ... [2024-11-12 03:26:19,826 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:26:19,827 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:26:19,828 INFO L158 Benchmark]: Toolchain (without parser) took 11153.50ms. Allocated memory was 172.0MB in the beginning and 352.3MB in the end (delta: 180.4MB). Free memory was 102.5MB in the beginning and 166.3MB in the end (delta: -63.8MB). Peak memory consumption was 118.3MB. Max. memory is 16.1GB. [2024-11-12 03:26:19,828 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:26:19,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.37ms. Allocated memory is still 172.0MB. Free memory was 102.3MB in the beginning and 85.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 03:26:19,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.89ms. Allocated memory is still 172.0MB. Free memory was 85.1MB in the beginning and 81.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:26:19,829 INFO L158 Benchmark]: Boogie Preprocessor took 65.09ms. Allocated memory is still 172.0MB. Free memory was 81.8MB in the beginning and 78.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 03:26:19,829 INFO L158 Benchmark]: RCFGBuilder took 600.28ms. Allocated memory is still 172.0MB. Free memory was 78.1MB in the beginning and 114.7MB in the end (delta: -36.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2024-11-12 03:26:19,829 INFO L158 Benchmark]: TraceAbstraction took 10034.66ms. Allocated memory was 172.0MB in the beginning and 352.3MB in the end (delta: 180.4MB). Free memory was 113.8MB in the beginning and 166.3MB in the end (delta: -52.5MB). Peak memory consumption was 130.7MB. Max. memory is 16.1GB. [2024-11-12 03:26:19,829 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 352.3MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:26:19,830 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory is still 130.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.37ms. Allocated memory is still 172.0MB. Free memory was 102.3MB in the beginning and 85.1MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.89ms. Allocated memory is still 172.0MB. Free memory was 85.1MB in the beginning and 81.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.09ms. Allocated memory is still 172.0MB. Free memory was 81.8MB in the beginning and 78.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 600.28ms. Allocated memory is still 172.0MB. Free memory was 78.1MB in the beginning and 114.7MB in the end (delta: -36.6MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10034.66ms. Allocated memory was 172.0MB in the beginning and 352.3MB in the end (delta: 180.4MB). Free memory was 113.8MB in the beginning and 166.3MB in the end (delta: -52.5MB). Peak memory consumption was 130.7MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 352.3MB. Free memory is still 166.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 177, overapproximation of bitwiseOr at line 85, overapproximation of someUnaryDOUBLEoperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someUnaryFLOAToperation at line 95, overapproximation of someBinaryArithmeticFLOAToperation at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_28 = 64; [L44] float var_1_33 = 10.775; [L45] unsigned long int var_1_41 = 256; [L46] unsigned long int var_1_45 = 64; [L47] double var_1_46 = 31.1; [L48] signed char var_1_47 = 50; [L49] signed char var_1_48 = 16; [L50] double last_1_var_1_22 = 200.8; VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L174] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L134] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L136] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L137] var_1_6 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L138] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L140] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L143] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L146] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L152] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L156] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L158] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L159] var_1_23 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L160] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L162] var_1_24 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L163] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L165] var_1_28 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L166] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L169] var_1_48 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_48 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L170] RET assume_abort_if_not(var_1_48 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] CALL assume_abort_if_not(var_1_48 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] RET assume_abort_if_not(var_1_48 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L185] RET updateVariables() [L186] CALL step() [L54] COND TRUE ! (var_1_4 < 16.8f) [L55] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] EXPR var_1_25 ^ (var_1_28 + var_1_24) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] COND TRUE (var_1_25 ^ (var_1_28 + var_1_24)) <= (((((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) < 0 ) ? -((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) : ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))))) [L58] var_1_33 = (((((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))) < 0 ) ? -((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))) : ((((((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) < (var_1_18)) ? (((((var_1_4) < (var_1_4)) ? (var_1_4) : (var_1_4)))) : (var_1_18))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L66] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=2, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L75] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L76] EXPR var_1_25 & var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L76] COND TRUE (var_1_25 & var_1_25) <= var_1_25 [L77] COND FALSE !(var_1_19 <= var_1_5) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L85] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L86] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L94] COND TRUE var_1_24 != var_1_25 [L95] var_1_46 = ((((((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) < 0 ) ? -(((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))) : (((((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) < 0 ) ? -((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))) : ((((var_1_6) < (var_1_4)) ? (var_1_6) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L99] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2/5, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L102] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L103] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L108] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32768, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L109] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L116] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32768, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=64, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L118] var_1_45 = var_1_23 [L119] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32768, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_1=318/5, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=32768, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L120] COND TRUE stepLocal_0 || var_1_7 [L121] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32768, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=1, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=32768, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L123] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L124] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32768, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=0, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=32768, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L126] COND TRUE (var_1_25 % var_1_28) >= var_1_25 [L127] var_1_26 = (var_1_7 || var_1_11) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32768, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=1, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=32768, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=1, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=32768, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L177-L178] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=1, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=32768, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=-256, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=5, var_1_21=50, var_1_22=5, var_1_23=32768, var_1_24=1, var_1_25=32768, var_1_26=1, var_1_28=-1, var_1_33=3, var_1_41=256, var_1_45=32768, var_1_46=4, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 10, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1748 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1716 mSDsluCounter, 4001 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2628 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 1373 mSDtfsCounter, 2558 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1213 GetRequests, 1137 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390occurred in iteration=7, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 207 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2191 NumberOfCodeBlocks, 2191 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2169 ConstructedInterpolants, 0 QuantifiedInterpolants, 4272 SizeOfPredicates, 4 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 14208/14352 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 03:26:19,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:26:22,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:26:22,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:26:22,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:26:22,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:26:22,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:26:22,231 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:26:22,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:26:22,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:26:22,233 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:26:22,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:26:22,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:26:22,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:26:22,235 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:26:22,235 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:26:22,236 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:26:22,236 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:26:22,236 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:26:22,239 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:26:22,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:26:22,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:26:22,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:26:22,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:26:22,241 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:26:22,241 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:26:22,241 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:26:22,241 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:26:22,242 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:26:22,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:26:22,242 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:26:22,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:26:22,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:26:22,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:26:22,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:26:22,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:22,244 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:26:22,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:26:22,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:26:22,244 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:26:22,244 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:26:22,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:26:22,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:26:22,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:26:22,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:26:22,248 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8ebe53e2d17a2fa87bba35599cac4d45c29a83d2dafeb005aff61ed635ff5cb4 [2024-11-12 03:26:22,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:26:22,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:26:22,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:26:22,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:26:22,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:26:22,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-11-12 03:26:23,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:26:24,229 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:26:24,229 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-11-12 03:26:24,242 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f483a7cc0/89ef9e78f6a64a71b93ab8e5173837d0/FLAGb15ab0040 [2024-11-12 03:26:24,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f483a7cc0/89ef9e78f6a64a71b93ab8e5173837d0 [2024-11-12 03:26:24,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:26:24,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:26:24,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:24,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:26:24,268 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:26:24,269 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5470cf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24, skipping insertion in model container [2024-11-12 03:26:24,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,298 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:26:24,458 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-11-12 03:26:24,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:24,559 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:26:24,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i[919,932] [2024-11-12 03:26:24,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:24,634 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:26:24,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24 WrapperNode [2024-11-12 03:26:24,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:24,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:24,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:26:24,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:26:24,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,705 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-12 03:26:24,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:24,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:26:24,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:26:24,710 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:26:24,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,728 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,762 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:26:24,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,779 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,801 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:26:24,802 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:26:24,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:26:24,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:26:24,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (1/1) ... [2024-11-12 03:26:24,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:24,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:24,846 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:26:24,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:26:24,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:26:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:26:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:26:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:26:24,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:26:24,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:26:24,991 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:26:24,993 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:26:46,139 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 03:26:46,140 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:26:46,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:26:46,161 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:26:46,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:46 BoogieIcfgContainer [2024-11-12 03:26:46,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:26:46,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:26:46,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:26:46,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:26:46,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:26:24" (1/3) ... [2024-11-12 03:26:46,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab8eb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:46, skipping insertion in model container [2024-11-12 03:26:46,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:24" (2/3) ... [2024-11-12 03:26:46,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ab8eb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:46, skipping insertion in model container [2024-11-12 03:26:46,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:46" (3/3) ... [2024-11-12 03:26:46,178 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-75.i [2024-11-12 03:26:46,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:26:46,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:26:46,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:26:46,277 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2e16d67f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:26:46,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:26:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:26:46,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-12 03:26:46,299 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:46,307 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:46,308 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:46,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash 772789377, now seen corresponding path program 1 times [2024-11-12 03:26:46,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:26:46,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702348711] [2024-11-12 03:26:46,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:46,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:26:46,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:26:46,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:26:46,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 03:26:47,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:47,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:26:47,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:47,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-12 03:26:47,122 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:26:47,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:26:47,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702348711] [2024-11-12 03:26:47,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702348711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:47,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:47,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:26:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928358446] [2024-11-12 03:26:47,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:47,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:26:47,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:26:47,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:26:47,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:26:47,155 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:26:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:47,176 INFO L93 Difference]: Finished difference Result 155 states and 272 transitions. [2024-11-12 03:26:47,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:26:47,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2024-11-12 03:26:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:47,185 INFO L225 Difference]: With dead ends: 155 [2024-11-12 03:26:47,185 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 03:26:47,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:26:47,191 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:26:47,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:26:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 03:26:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 03:26:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-12 03:26:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 118 transitions. [2024-11-12 03:26:47,228 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 118 transitions. Word has length 158 [2024-11-12 03:26:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:47,229 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 118 transitions. [2024-11-12 03:26:47,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-12 03:26:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 118 transitions. [2024-11-12 03:26:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 03:26:47,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:47,233 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 03:26:47,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 03:26:47,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:26:47,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:47,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1064709280, now seen corresponding path program 1 times [2024-11-12 03:26:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:26:47,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676498245] [2024-11-12 03:26:47,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:47,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 03:26:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:26:47,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 03:26:47,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 03:26:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:48,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 03:26:48,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:20,236 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 03:27:32,677 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-12 03:27:40,849 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)