./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_operatoramount_amount100_file-6.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 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:26:36,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:26:36,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:26:36,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:26:36,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:26:36,419 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:26:36,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:26:36,420 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:26:36,420 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:26:36,423 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:26:36,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:26:36,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:26:36,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:26:36,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:26:36,425 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:26:36,427 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:26:36,427 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:26:36,427 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:26:36,428 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:26:36,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:26:36,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:26:36,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:26:36,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:26:36,430 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:26:36,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:26:36,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:26:36,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:26:36,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:26:36,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:26:36,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:26:36,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:26:36,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:26:36,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:26:36,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:26:36,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:26:36,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:26:36,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:26:36,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:26:36,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:26:36,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:26:36,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:26:36,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:26:36,436 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 -> 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 [2024-11-09 00:26:36,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:26:36,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:26:36,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:26:36,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:26:36,704 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:26:36,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-09 00:26:38,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:26:38,249 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:26:38,250 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-09 00:26:38,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d702fd2/57bd444cbb274160bb48d73e270b6129/FLAG4a962ae94 [2024-11-09 00:26:38,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6d702fd2/57bd444cbb274160bb48d73e270b6129 [2024-11-09 00:26:38,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:26:38,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:26:38,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:26:38,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:26:38,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:26:38,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:38,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fe576e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38, skipping insertion in model container [2024-11-09 00:26:38,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:38,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:26:38,817 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_operatoramount_amount100_file-6.i[915,928] [2024-11-09 00:26:38,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:26:38,895 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:26:38,908 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_operatoramount_amount100_file-6.i[915,928] [2024-11-09 00:26:38,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:26:38,961 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:26:38,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38 WrapperNode [2024-11-09 00:26:38,962 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:26:38,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:26:38,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:26:38,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:26:38,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:38,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,051 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2024-11-09 00:26:39,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:26:39,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:26:39,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:26:39,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:26:39,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,071 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,105 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-09 00:26:39,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:26:39,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:26:39,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:26:39,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:26:39,150 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (1/1) ... [2024-11-09 00:26:39,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:26:39,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:26:39,181 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-09 00:26:39,185 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-09 00:26:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:26:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:26:39,226 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:26:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:26:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:26:39,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:26:39,307 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:26:39,309 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:26:39,712 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-09 00:26:39,713 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:26:39,727 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:26:39,728 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:26:39,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:26:39 BoogieIcfgContainer [2024-11-09 00:26:39,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:26:39,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:26:39,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:26:39,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:26:39,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:26:38" (1/3) ... [2024-11-09 00:26:39,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64aebd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:26:39, skipping insertion in model container [2024-11-09 00:26:39,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:38" (2/3) ... [2024-11-09 00:26:39,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64aebd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:26:39, skipping insertion in model container [2024-11-09 00:26:39,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:26:39" (3/3) ... [2024-11-09 00:26:39,738 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-6.i [2024-11-09 00:26:39,753 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:26:39,754 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:26:39,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:26:39,817 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;@30b890da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:26:39,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:26:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:26:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:26:39,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:26:39,836 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:39,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:26:39,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:26:39,840 INFO L85 PathProgramCache]: Analyzing trace with hash -673249065, now seen corresponding path program 1 times [2024-11-09 00:26:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:26:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74745778] [2024-11-09 00:26:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:39,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:26:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:26:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:26:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:26:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:26:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:26:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:26:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:26:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:26:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:26:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:26:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:26:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:26:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:26:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:26:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:26:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:26:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:26:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:26:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:26:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:26:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:26:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:26:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:26:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:26:40,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:26:40,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74745778] [2024-11-09 00:26:40,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74745778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:26:40,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:26:40,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:26:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099152761] [2024-11-09 00:26:40,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:26:40,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:26:40,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:26:40,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:26:40,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:26:40,256 INFO L87 Difference]: Start difference. First operand has 91 states, 65 states have (on average 1.4615384615384615) internal successors, (95), 66 states have internal predecessors, (95), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:26:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:26:40,281 INFO L93 Difference]: Finished difference Result 174 states and 297 transitions. [2024-11-09 00:26:40,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:26:40,283 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 153 [2024-11-09 00:26:40,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:26:40,289 INFO L225 Difference]: With dead ends: 174 [2024-11-09 00:26:40,289 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 00:26:40,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-09 00:26:40,295 INFO L432 NwaCegarLoop]: 131 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, 131 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-09 00:26:40,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:26:40,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 00:26:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-09 00:26:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:26:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 131 transitions. [2024-11-09 00:26:40,340 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 131 transitions. Word has length 153 [2024-11-09 00:26:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:26:40,340 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 131 transitions. [2024-11-09 00:26:40,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:26:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 131 transitions. [2024-11-09 00:26:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:26:40,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:26:40,346 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:40,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:26:40,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:26:40,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:26:40,347 INFO L85 PathProgramCache]: Analyzing trace with hash 869400593, now seen corresponding path program 1 times [2024-11-09 00:26:40,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:26:40,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695108683] [2024-11-09 00:26:40,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:40,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:26:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:26:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:26:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:26:40,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:26:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:26:40,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:26:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:26:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:26:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:26:40,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:26:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:26:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:26:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:26:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:26:40,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:26:40,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:26:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:26:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:26:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:26:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:26:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:26:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:26:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:26:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:26:40,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:26:40,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695108683] [2024-11-09 00:26:40,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695108683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:26:40,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:26:40,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:26:40,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262633676] [2024-11-09 00:26:40,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:26:40,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:26:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:26:40,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:26:40,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:26:40,766 INFO L87 Difference]: Start difference. First operand 86 states and 131 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:26:40,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:26:40,865 INFO L93 Difference]: Finished difference Result 253 states and 378 transitions. [2024-11-09 00:26:40,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:26:40,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 153 [2024-11-09 00:26:40,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:26:40,869 INFO L225 Difference]: With dead ends: 253 [2024-11-09 00:26:40,869 INFO L226 Difference]: Without dead ends: 170 [2024-11-09 00:26:40,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:26:40,872 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 110 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:26:40,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 436 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:26:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-09 00:26:40,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2024-11-09 00:26:40,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 115 states have (on average 1.434782608695652) internal successors, (165), 116 states have internal predecessors, (165), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:26:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 215 transitions. [2024-11-09 00:26:40,899 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 215 transitions. Word has length 153 [2024-11-09 00:26:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:26:40,900 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 215 transitions. [2024-11-09 00:26:40,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:26:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 215 transitions. [2024-11-09 00:26:40,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:26:40,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:26:40,902 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:40,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:26:40,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:26:40,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:26:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash -151667761, now seen corresponding path program 1 times [2024-11-09 00:26:40,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:26:40,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803044213] [2024-11-09 00:26:40,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:40,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:26:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:26:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:26:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:26:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:26:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:26:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:26:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:26:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:26:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:26:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:26:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:26:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:26:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:26:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:26:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:26:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:26:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:26:42,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:26:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:26:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:26:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:26:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:26:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:26:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:26:42,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:26:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803044213] [2024-11-09 00:26:42,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803044213] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:26:42,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68726508] [2024-11-09 00:26:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:42,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:26:42,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:26:42,438 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-09 00:26:42,440 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-09 00:26:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:42,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 00:26:42,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:26:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 510 proven. 42 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2024-11-09 00:26:43,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:26:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 138 proven. 51 refuted. 0 times theorem prover too weak. 823 trivial. 0 not checked. [2024-11-09 00:26:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68726508] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:26:43,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:26:43,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 34 [2024-11-09 00:26:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674441228] [2024-11-09 00:26:43,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:26:43,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 00:26:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:26:43,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 00:26:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=908, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 00:26:43,966 INFO L87 Difference]: Start difference. First operand 143 states and 215 transitions. Second operand has 34 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 9 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (39), 8 states have call predecessors, (39), 9 states have call successors, (39) [2024-11-09 00:26:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:26:47,489 INFO L93 Difference]: Finished difference Result 581 states and 805 transitions. [2024-11-09 00:26:47,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-09 00:26:47,489 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 9 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (39), 8 states have call predecessors, (39), 9 states have call successors, (39) Word has length 153 [2024-11-09 00:26:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:26:47,499 INFO L225 Difference]: With dead ends: 581 [2024-11-09 00:26:47,499 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 00:26:47,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2489 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2296, Invalid=7604, Unknown=0, NotChecked=0, Total=9900 [2024-11-09 00:26:47,507 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 972 mSDsluCounter, 1391 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:26:47,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 1599 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 00:26:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 00:26:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 220. [2024-11-09 00:26:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 171 states have (on average 1.3567251461988303) internal successors, (232), 173 states have internal predecessors, (232), 40 states have call successors, (40), 8 states have call predecessors, (40), 8 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:26:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 312 transitions. [2024-11-09 00:26:47,550 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 312 transitions. Word has length 153 [2024-11-09 00:26:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:26:47,550 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 312 transitions. [2024-11-09 00:26:47,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 32 states have (on average 3.1875) internal successors, (102), 32 states have internal predecessors, (102), 9 states have call successors, (38), 4 states have call predecessors, (38), 9 states have return successors, (39), 8 states have call predecessors, (39), 9 states have call successors, (39) [2024-11-09 00:26:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 312 transitions. [2024-11-09 00:26:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 00:26:47,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:26:47,552 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:47,570 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-09 00:26:47,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:26:47,757 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:26:47,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:26:47,758 INFO L85 PathProgramCache]: Analyzing trace with hash -774444052, now seen corresponding path program 1 times [2024-11-09 00:26:47,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:26:47,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739849801] [2024-11-09 00:26:47,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:47,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:26:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:26:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:26:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:26:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:26:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:26:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:26:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:26:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:26:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:26:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:26:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:26:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:26:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:26:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:26:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:26:48,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:26:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:26:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:26:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:26:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:26:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:26:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:26:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:26:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:26:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:26:48,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739849801] [2024-11-09 00:26:48,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739849801] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:26:48,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465203719] [2024-11-09 00:26:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:48,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:26:48,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:26:48,107 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-09 00:26:48,109 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-09 00:26:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:48,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:26:48,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:26:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 318 proven. 54 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-09 00:26:48,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:26:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:26:48,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465203719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:26:48,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:26:48,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2024-11-09 00:26:48,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565509163] [2024-11-09 00:26:48,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:26:48,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:26:48,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:26:48,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:26:48,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:26:48,617 INFO L87 Difference]: Start difference. First operand 220 states and 312 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-11-09 00:26:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:26:48,779 INFO L93 Difference]: Finished difference Result 427 states and 595 transitions. [2024-11-09 00:26:48,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:26:48,781 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 154 [2024-11-09 00:26:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:26:48,783 INFO L225 Difference]: With dead ends: 427 [2024-11-09 00:26:48,783 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 00:26:48,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:26:48,784 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:26:48,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 246 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:26:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 00:26:48,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2024-11-09 00:26:48,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 149 states have (on average 1.308724832214765) internal successors, (195), 151 states have internal predecessors, (195), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:26:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 275 transitions. [2024-11-09 00:26:48,813 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 275 transitions. Word has length 154 [2024-11-09 00:26:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:26:48,814 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 275 transitions. [2024-11-09 00:26:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 4 states have call successors, (59), 2 states have call predecessors, (59), 4 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-11-09 00:26:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 275 transitions. [2024-11-09 00:26:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-09 00:26:48,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:26:48,818 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:48,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:26:49,019 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,SelfDestructingSolverStorable3 [2024-11-09 00:26:49,020 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:26:49,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:26:49,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1269515204, now seen corresponding path program 1 times [2024-11-09 00:26:49,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:26:49,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491351820] [2024-11-09 00:26:49,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:49,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:26:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:26:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:26:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:26:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:26:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:26:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:26:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:26:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:26:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:26:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-09 00:26:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 00:26:49,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 00:26:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 00:26:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 00:26:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 00:26:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 00:26:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 00:26:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 00:26:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:26:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:26:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 00:26:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 00:26:49,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 00:26:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:26:49,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:26:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:26:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491351820] [2024-11-09 00:26:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491351820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:26:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:26:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:26:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585806077] [2024-11-09 00:26:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:26:49,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:26:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:26:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:26:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:26:49,107 INFO L87 Difference]: Start difference. First operand 200 states and 275 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:26:49,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:26:49,147 INFO L93 Difference]: Finished difference Result 434 states and 605 transitions. [2024-11-09 00:26:49,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:26:49,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 154 [2024-11-09 00:26:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:26:49,150 INFO L225 Difference]: With dead ends: 434 [2024-11-09 00:26:49,150 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 00:26:49,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-09 00:26:49,153 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 42 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:26:49,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 252 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:26:49,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 00:26:49,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 242. [2024-11-09 00:26:49,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 191 states have (on average 1.3298429319371727) internal successors, (254), 193 states have internal predecessors, (254), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-09 00:26:49,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 334 transitions. [2024-11-09 00:26:49,174 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 334 transitions. Word has length 154 [2024-11-09 00:26:49,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:26:49,174 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 334 transitions. [2024-11-09 00:26:49,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:26:49,174 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 334 transitions. [2024-11-09 00:26:49,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 00:26:49,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:26:49,180 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:26:49,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:26:49,180 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:26:49,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:26:49,180 INFO L85 PathProgramCache]: Analyzing trace with hash -475421874, now seen corresponding path program 1 times [2024-11-09 00:26:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:26:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775000698] [2024-11-09 00:26:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:26:49,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:26:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:26:49,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:26:49,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:26:49,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:26:49,382 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:26:49,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:26:49,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:26:49,387 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-09 00:26:49,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:26:49,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:26:49 BoogieIcfgContainer [2024-11-09 00:26:49,481 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:26:49,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:26:49,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:26:49,482 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:26:49,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:26:39" (3/4) ... [2024-11-09 00:26:49,484 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:26:49,485 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:26:49,485 INFO L158 Benchmark]: Toolchain (without parser) took 10845.56ms. Allocated memory was 127.9MB in the beginning and 270.5MB in the end (delta: 142.6MB). Free memory was 73.0MB in the beginning and 229.9MB in the end (delta: -156.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:26:49,486 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 127.9MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:26:49,486 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.88ms. Allocated memory is still 127.9MB. Free memory was 73.0MB in the beginning and 53.9MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 00:26:49,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.24ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 53.9MB in the beginning and 157.1MB in the end (delta: -103.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-09 00:26:49,486 INFO L158 Benchmark]: Boogie Preprocessor took 90.42ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 147.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-09 00:26:49,486 INFO L158 Benchmark]: RCFGBuilder took 580.01ms. Allocated memory is still 186.6MB. Free memory was 147.8MB in the beginning and 117.4MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-09 00:26:49,487 INFO L158 Benchmark]: TraceAbstraction took 9749.41ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 116.4MB in the beginning and 231.0MB in the end (delta: -114.6MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. [2024-11-09 00:26:49,487 INFO L158 Benchmark]: Witness Printer took 3.51ms. Allocated memory is still 270.5MB. Free memory was 231.0MB in the beginning and 229.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:26:49,488 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 127.9MB. Free memory is still 88.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.88ms. Allocated memory is still 127.9MB. Free memory was 73.0MB in the beginning and 53.9MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.24ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 53.9MB in the beginning and 157.1MB in the end (delta: -103.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.42ms. Allocated memory is still 186.6MB. Free memory was 157.1MB in the beginning and 147.8MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 580.01ms. Allocated memory is still 186.6MB. Free memory was 147.8MB in the beginning and 117.4MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9749.41ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 116.4MB in the beginning and 231.0MB in the end (delta: -114.6MB). Peak memory consumption was 120.3MB. Max. memory is 16.1GB. * Witness Printer took 3.51ms. Allocated memory is still 270.5MB. Free memory was 231.0MB in the beginning and 229.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticDOUBLEoperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned short int var_1_5 = 34011; [L26] unsigned short int var_1_6 = 2; [L27] signed short int var_1_7 = -4; [L28] signed long int var_1_9 = -4; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_12 = 1.8; [L31] double var_1_13 = 49.5; [L32] double var_1_14 = 0.0; [L33] double var_1_15 = 8.5; [L34] unsigned long int var_1_16 = 4; [L35] float var_1_17 = 3.65; [L36] unsigned char var_1_18 = 0; [L37] signed long int var_1_19 = 32; [L38] signed long int var_1_20 = 1000000000; [L39] signed long int var_1_21 = 1141305717; [L40] unsigned char var_1_22 = 50; [L41] unsigned char var_1_23 = 0; [L42] unsigned short int var_1_24 = 2; [L43] signed short int var_1_25 = -16; [L44] double var_1_26 = 15.6; [L45] double var_1_27 = 4.25; [L46] unsigned long int var_1_28 = 10; [L47] unsigned char last_1_var_1_22 = 50; VAL [isInitial=0, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=1, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L186] RET updateLastVariables() [L187] CALL updateVariables() [L138] var_1_2 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L139] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L140] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L141] var_1_3 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L142] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L143] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=34011, var_1_6=2, var_1_7=-4, var_1_9=-4] [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=2, var_1_7=-4, var_1_9=-4] [L147] var_1_6 = __VERIFIER_nondet_ushort() [L148] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4] [L148] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_7=-4, var_1_9=-4] [L149] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L149] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_13=99/2, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L150] var_1_13 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_14=0, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L152] var_1_14 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L153] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_15=17/2, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L154] var_1_15 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L155] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=0, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L156] var_1_18 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L157] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L158] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1000000000, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L159] var_1_20 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_20 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L160] RET assume_abort_if_not(var_1_20 >= 536870911) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] CALL assume_abort_if_not(var_1_20 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L161] RET assume_abort_if_not(var_1_20 <= 1073741823) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=1141305717, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L162] var_1_21 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_21 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L163] RET assume_abort_if_not(var_1_21 >= 1073741822) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L164] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=0, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L165] var_1_23 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L166] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L167] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_26=78/5, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L168] var_1_26 = __VERIFIER_nondet_double() [L169] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L169] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L170] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_27=17/4, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L171] var_1_27 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L172] RET assume_abort_if_not((var_1_27 >= -922337.2036854776000e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854776000e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] CALL assume_abort_if_not(var_1_27 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L173] RET assume_abort_if_not(var_1_27 != 0.0F) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=-4] [L187] RET updateVariables() [L188] CALL step() [L51] var_1_9 = (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22) [L52] unsigned char stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_2=-255, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=50, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0] [L53] COND TRUE stepLocal_2 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3)) [L54] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=2, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0] [L58] COND TRUE var_1_2 || var_1_3 [L59] var_1_1 = ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=-4, var_1_9=0] [L63] COND FALSE !(var_1_22 <= (- 500)) [L68] var_1_7 = var_1_22 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=4, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L70] var_1_10 = (var_1_5 - (var_1_22 + 1000)) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_12=9/5, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L71] COND FALSE !(! var_1_3) [L74] var_1_12 = (var_1_14 - var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L76] unsigned char stepLocal_0 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L77] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_0=254, var_1_10=31513, var_1_16=4, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L80] COND TRUE ((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= stepLocal_0 [L81] var_1_16 = 128u VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_17=73/20, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L86] COND TRUE \read(var_1_18) [L87] var_1_17 = (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=10, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L99] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=2, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L100] COND TRUE ! ((! var_1_3) && var_1_18) [L101] var_1_24 = ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L107] unsigned short int stepLocal_4 = var_1_24; [L108] unsigned short int stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L109] COND FALSE !(((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L122] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_22=50, stepLocal_1=254, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L123] COND TRUE var_1_24 >= stepLocal_1 VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=32, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L124] COND TRUE ! var_1_2 [L125] var_1_19 = (var_1_22 - (var_1_22 + (var_1_20 - 5))) VAL [isInitial=1, last_1_var_1_22=50, stepLocal_3=31513, stepLocal_4=254, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L188] RET step() [L189] CALL, EXPR property() [L179] EXPR (((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L179-L180] return ((((((((((((var_1_2 || var_1_3) ? (var_1_1 == ((unsigned short int) ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_22)) < (var_1_22)) ? ((var_1_5 - var_1_22)) : (var_1_22)))))) && ((var_1_22 <= (- 500)) ? (var_1_2 ? (var_1_7 == ((signed short int) (var_1_22 - 64))) : 1) : (var_1_7 == ((signed short int) var_1_22)))) && (var_1_9 == ((signed long int) (((((last_1_var_1_22) < 0 ) ? -(last_1_var_1_22) : (last_1_var_1_22))) - last_1_var_1_22)))) && (var_1_10 == ((unsigned short int) (var_1_5 - (var_1_22 + 1000))))) && ((! var_1_3) ? (var_1_12 == ((double) ((var_1_13 - (var_1_14 - 63.5)) + var_1_15))) : (var_1_12 == ((double) (var_1_14 - var_1_13))))) && (var_1_2 ? (var_1_16 == ((unsigned long int) (var_1_9 + 200u))) : ((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22))) <= var_1_22) ? (var_1_16 == ((unsigned long int) 128u)) : (var_1_16 == ((unsigned long int) var_1_22))))) && (var_1_18 ? (var_1_17 == ((float) (((((var_1_14) < (255.4f)) ? (var_1_14) : (255.4f))) + var_1_13))) : (var_1_3 ? (var_1_2 ? (var_1_17 == ((float) var_1_15)) : (var_1_17 == ((float) 0.050000000000000044f))) : (var_1_17 == ((float) var_1_13))))) && ((var_1_24 >= var_1_22) ? ((! var_1_2) ? (var_1_19 == ((signed long int) (var_1_22 - (var_1_22 + (var_1_20 - 5))))) : (var_1_2 ? (var_1_18 ? (var_1_19 == ((signed long int) ((var_1_21 - ((((var_1_20) > (var_1_22)) ? (var_1_20) : (var_1_22)))) - (var_1_22 + ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))) : 1) : 1)) : (var_1_19 == ((signed long int) var_1_20)))) && ((var_1_18 || ((var_1_6 == var_1_9) || (var_1_2 && var_1_3))) ? (var_1_22 == ((unsigned char) var_1_23)) : (var_1_22 == ((unsigned char) var_1_23)))) && ((! ((! var_1_3) && var_1_18)) ? (var_1_24 == ((unsigned short int) ((((((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) < (var_1_28)) ? (((((var_1_22) < (var_1_22)) ? (var_1_22) : (var_1_22)))) : (var_1_28))))) : ((var_1_22 < ((var_1_5 - var_1_23) * 32)) ? (var_1_24 == ((unsigned short int) var_1_22)) : 1))) && ((((var_1_14 - var_1_13) / ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27)))) >= var_1_15) ? ((var_1_14 >= var_1_13) ? (((var_1_22 << var_1_22) <= var_1_24) ? (var_1_25 == ((signed short int) (((((var_1_22) < (var_1_16)) ? (var_1_22) : (var_1_16))) - var_1_23))) : (var_1_25 == ((signed short int) (var_1_16 + var_1_23)))) : ((var_1_5 == var_1_10) ? (var_1_25 == ((signed short int) var_1_16)) : 1)) : 1)) && (var_1_28 == ((unsigned long int) var_1_21)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=50, var_1_10=31513, var_1_16=128, var_1_18=-255, var_1_19=-1073741818, var_1_1=254, var_1_20=1073741823, var_1_21=2147483646, var_1_22=254, var_1_23=254, var_1_24=254, var_1_25=-16, var_1_28=2147483646, var_1_2=0, var_1_3=1, var_1_5=-16678913, var_1_6=0, var_1_7=254, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1247 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1243 mSDsluCounter, 2664 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1906 mSDsCounter, 457 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2853 IncrementalHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 457 mSolverCounterUnsat, 758 mSDtfsCounter, 2853 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 972 GetRequests, 860 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2495 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=5, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 290 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 1229 NumberOfCodeBlocks, 1229 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1372 ConstructedInterpolants, 0 QuantifiedInterpolants, 3770 SizeOfPredicates, 12 NumberOfNonLiveVariables, 708 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 8832/9108 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-09 00:26:49,522 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_operatoramount_amount100_file-6.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 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:26:51,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:26:51,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:26:51,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:26:51,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:26:51,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:26:51,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:26:51,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:26:51,628 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:26:51,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:26:51,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:26:51,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:26:51,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:26:51,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:26:51,630 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:26:51,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:26:51,631 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:26:51,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:26:51,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:26:51,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:26:51,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:26:51,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:26:51,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:26:51,636 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:26:51,636 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:26:51,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:26:51,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:26:51,637 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:26:51,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:26:51,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:26:51,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:26:51,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:26:51,638 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:26:51,638 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:26:51,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:26:51,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:26:51,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:26:51,639 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:26:51,639 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:26:51,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:26:51,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:26:51,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:26:51,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:26:51,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:26:51,642 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 -> 2d3e3fe1097eb5cc161ed209d4e6f9c5a89785e619e27e5f9e0923413431f0b1 [2024-11-09 00:26:51,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:26:51,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:26:51,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:26:51,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:26:51,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:26:51,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-09 00:26:53,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:26:53,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:26:53,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-6.i [2024-11-09 00:26:53,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c56010a/7d14e7e43d3943aabcc24c42f39aa649/FLAG4ec9d32f1 [2024-11-09 00:26:53,894 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33c56010a/7d14e7e43d3943aabcc24c42f39aa649 [2024-11-09 00:26:53,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:26:53,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:26:53,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:26:53,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:26:53,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:26:53,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:26:53" (1/1) ... [2024-11-09 00:26:53,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f52b209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:53, skipping insertion in model container [2024-11-09 00:26:53,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:26:53" (1/1) ... [2024-11-09 00:26:53,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:26:54,091 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_operatoramount_amount100_file-6.i[915,928] [2024-11-09 00:26:54,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:26:54,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:26:54,204 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_operatoramount_amount100_file-6.i[915,928] [2024-11-09 00:26:54,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:26:54,279 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:26:54,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54 WrapperNode [2024-11-09 00:26:54,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:26:54,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:26:54,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:26:54,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:26:54,287 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,305 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,342 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-09 00:26:54,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:26:54,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:26:54,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:26:54,344 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:26:54,355 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,355 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,381 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-09 00:26:54,383 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,383 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,405 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,417 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:26:54,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:26:54,422 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:26:54,422 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:26:54,424 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (1/1) ... [2024-11-09 00:26:54,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:26:54,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:26:54,479 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-09 00:26:54,499 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-09 00:26:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:26:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:26:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:26:54,532 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:26:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:26:54,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:26:54,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:26:54,605 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:27:09,818 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-09 00:27:09,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:27:09,833 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:27:09,833 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:27:09,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:09 BoogieIcfgContainer [2024-11-09 00:27:09,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:27:09,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:27:09,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:27:09,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:27:09,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:26:53" (1/3) ... [2024-11-09 00:27:09,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adff092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:09, skipping insertion in model container [2024-11-09 00:27:09,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:26:54" (2/3) ... [2024-11-09 00:27:09,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@adff092 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:27:09, skipping insertion in model container [2024-11-09 00:27:09,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:27:09" (3/3) ... [2024-11-09 00:27:09,840 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-6.i [2024-11-09 00:27:09,856 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:27:09,857 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:27:09,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:27:09,920 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;@14fad1fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:27:09,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:27:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:27:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:27:09,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:09,936 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:09,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:09,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash 699911681, now seen corresponding path program 1 times [2024-11-09 00:27:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:27:09,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539982744] [2024-11-09 00:27:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:09,953 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-09 00:27:09,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:27:09,956 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-09 00:27:09,974 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-09 00:27:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:11,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:27:11,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-09 00:27:11,219 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:27:11,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:27:11,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539982744] [2024-11-09 00:27:11,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539982744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:11,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:27:11,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008205647] [2024-11-09 00:27:11,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:27:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:27:11,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:27:11,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:27:11,258 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:27:11,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:11,284 INFO L93 Difference]: Finished difference Result 152 states and 265 transitions. [2024-11-09 00:27:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:27:11,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2024-11-09 00:27:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:11,292 INFO L225 Difference]: With dead ends: 152 [2024-11-09 00:27:11,292 INFO L226 Difference]: Without dead ends: 75 [2024-11-09 00:27:11,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-09 00:27:11,297 INFO L432 NwaCegarLoop]: 115 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, 115 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-09 00:27:11,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:27:11,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-09 00:27:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-09 00:27:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:27:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 115 transitions. [2024-11-09 00:27:11,333 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 115 transitions. Word has length 151 [2024-11-09 00:27:11,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:11,333 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 115 transitions. [2024-11-09 00:27:11,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:27:11,334 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 115 transitions. [2024-11-09 00:27:11,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:27:11,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:11,336 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:11,372 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-09 00:27:11,537 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-09 00:27:11,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:11,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1318276027, now seen corresponding path program 1 times [2024-11-09 00:27:11,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:27:11,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995405720] [2024-11-09 00:27:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:11,540 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-09 00:27:11,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:27:11,541 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-09 00:27:11,543 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-09 00:27:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:12,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 00:27:12,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:27:13,215 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:27:13,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:27:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995405720] [2024-11-09 00:27:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995405720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:27:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:27:13,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:27:13,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842946426] [2024-11-09 00:27:13,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:27:13,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:27:13,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:27:13,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:27:13,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:13,221 INFO L87 Difference]: Start difference. First operand 75 states and 115 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:27:14,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:27:17,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:27:23,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:27:27,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:27:31,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:27:35,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:27:39,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:27:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:27:39,354 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2024-11-09 00:27:39,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:27:39,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-09 00:27:39,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:27:39,357 INFO L225 Difference]: With dead ends: 209 [2024-11-09 00:27:39,357 INFO L226 Difference]: Without dead ends: 137 [2024-11-09 00:27:39,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:27:39,359 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 78 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:27:39,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 353 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 26.1s Time] [2024-11-09 00:27:39,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-09 00:27:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2024-11-09 00:27:39,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 92 states have internal predecessors, (130), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 00:27:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2024-11-09 00:27:39,385 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 151 [2024-11-09 00:27:39,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:27:39,386 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2024-11-09 00:27:39,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:27:39,386 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2024-11-09 00:27:39,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-09 00:27:39,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:27:39,390 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:27:39,426 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-09 00:27:39,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-09 00:27:39,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:27:39,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:27:39,594 INFO L85 PathProgramCache]: Analyzing trace with hash 307158777, now seen corresponding path program 1 times [2024-11-09 00:27:39,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:27:39,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485812555] [2024-11-09 00:27:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:39,595 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-09 00:27:39,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:27:39,597 INFO L229 MonitoredProcess]: Starting monitored process 4 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-09 00:27:39,598 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 (4)] Waiting until timeout for monitored process [2024-11-09 00:27:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:40,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 00:27:40,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-09 00:27:44,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:27:46,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:27:46,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485812555] [2024-11-09 00:27:46,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485812555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:46,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [152987121] [2024-11-09 00:27:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:27:46,765 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:27:46,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:27:46,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:27:46,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 00:27:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:27:50,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:27:50,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:27:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-09 00:27:52,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:27:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [152987121] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:27:53,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:27:53,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2024-11-09 00:27:53,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126120591] [2024-11-09 00:27:53,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:27:53,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:27:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:27:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:27:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:27:53,407 INFO L87 Difference]: Start difference. First operand 119 states and 180 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:28:04,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:08,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-09 00:28:12,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]