./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:49:06,323 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:49:06,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:49:06,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:49:06,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:49:06,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:49:06,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:49:06,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:49:06,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:49:06,419 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:49:06,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:49:06,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:49:06,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:49:06,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:49:06,423 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:49:06,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:49:06,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:49:06,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:49:06,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:49:06,428 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:49:06,428 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:49:06,429 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:49:06,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:49:06,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:49:06,430 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:49:06,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:49:06,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:49:06,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:49:06,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:49:06,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:49:06,431 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:49:06,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:49:06,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:49:06,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:49:06,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:49:06,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:49:06,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:49:06,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:49:06,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:49:06,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:49:06,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:49:06,435 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:49:06,435 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-clean/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-clean/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 -> 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 [2024-10-11 11:49:06,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:49:06,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:49:06,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:49:06,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:49:06,747 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:49:06,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-11 11:49:08,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:49:08,435 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:49:08,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-11 11:49:08,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b57fbdd92/62173344b66a455390c689179f93a301/FLAGb515395fd [2024-10-11 11:49:08,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b57fbdd92/62173344b66a455390c689179f93a301 [2024-10-11 11:49:08,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:49:08,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:49:08,799 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:49:08,799 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:49:08,804 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:49:08,805 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:49:08" (1/1) ... [2024-10-11 11:49:08,806 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@380f60cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:08, skipping insertion in model container [2024-10-11 11:49:08,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:49:08" (1/1) ... [2024-10-11 11:49:08,840 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:49:09,024 WARN L248 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_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-11 11:49:09,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:49:09,107 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:49:09,118 WARN L248 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_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-11 11:49:09,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:49:09,165 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:49:09,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09 WrapperNode [2024-10-11 11:49:09,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:49:09,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:49:09,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:49:09,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:49:09,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,227 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-10-11 11:49:09,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:49:09,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:49:09,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:49:09,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:49:09,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,270 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-10-11 11:49:09,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,294 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:49:09,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:49:09,309 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:49:09,309 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:49:09,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (1/1) ... [2024-10-11 11:49:09,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:49:09,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:49:09,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:49:09,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:49:09,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:49:09,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:49:09,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:49:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:49:09,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:49:09,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:49:09,513 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:49:09,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:49:09,903 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:49:09,904 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:49:09,943 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:49:09,943 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:49:09,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:49:09 BoogieIcfgContainer [2024-10-11 11:49:09,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:49:09,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:49:09,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:49:09,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:49:09,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:49:08" (1/3) ... [2024-10-11 11:49:09,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fde222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:49:09, skipping insertion in model container [2024-10-11 11:49:09,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:09" (2/3) ... [2024-10-11 11:49:09,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49fde222 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:49:09, skipping insertion in model container [2024-10-11 11:49:09,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:49:09" (3/3) ... [2024-10-11 11:49:09,953 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-11 11:49:09,968 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:49:09,968 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:49:10,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:49:10,031 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;@3bc20334, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:49:10,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:49:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:49:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:49:10,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:10,052 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:49:10,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:10,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1290581143, now seen corresponding path program 1 times [2024-10-11 11:49:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:49:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522959837] [2024-10-11 11:49:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:49:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:49:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:49:10,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:49:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:49:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:49:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:49:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 11:49:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:49:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:49:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:49:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:49:10,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:49:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:49:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:49:10,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:49:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:49:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:49:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:49:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:49:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:49:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:49:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:49:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:49:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:49:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:49:10,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:49:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:49:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:49:10,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522959837] [2024-10-11 11:49:10,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522959837] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:10,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:10,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:49:10,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88952152] [2024-10-11 11:49:10,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:10,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:49:10,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:49:10,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:49:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:49:10,666 INFO L87 Difference]: Start difference. First operand has 73 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 45 states have internal predecessors, (63), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:49:10,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:10,729 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2024-10-11 11:49:10,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:49:10,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 161 [2024-10-11 11:49:10,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:10,743 INFO L225 Difference]: With dead ends: 145 [2024-10-11 11:49:10,744 INFO L226 Difference]: Without dead ends: 71 [2024-10-11 11:49:10,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-11 11:49:10,752 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:10,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:49:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-11 11:49:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-10-11 11:49:10,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:49:10,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 110 transitions. [2024-10-11 11:49:10,803 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 110 transitions. Word has length 161 [2024-10-11 11:49:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:10,803 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 110 transitions. [2024-10-11 11:49:10,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:49:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 110 transitions. [2024-10-11 11:49:10,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:49:10,810 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:10,810 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:49:10,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:49:10,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:10,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:10,811 INFO L85 PathProgramCache]: Analyzing trace with hash -685416791, now seen corresponding path program 1 times [2024-10-11 11:49:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:49:10,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675225760] [2024-10-11 11:49:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:10,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:49:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:49:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:49:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:49:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:49:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:49:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 11:49:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 11:49:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 11:49:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 11:49:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 11:49:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 11:49:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 11:49:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 11:49:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 11:49:11,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 11:49:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 11:49:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 11:49:11,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 11:49:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 11:49:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:49:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 11:49:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:49:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 11:49:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 11:49:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 11:49:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:49:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:49:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:49:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675225760] [2024-10-11 11:49:11,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675225760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:11,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:11,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:49:11,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213210089] [2024-10-11 11:49:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:11,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:49:11,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:49:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:49:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:49:11,230 INFO L87 Difference]: Start difference. First operand 71 states and 110 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:49:11,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:11,283 INFO L93 Difference]: Finished difference Result 142 states and 221 transitions. [2024-10-11 11:49:11,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:49:11,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 161 [2024-10-11 11:49:11,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:11,289 INFO L225 Difference]: With dead ends: 142 [2024-10-11 11:49:11,291 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 11:49:11,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-11 11:49:11,293 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:11,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:49:11,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 11:49:11,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 11:49:11,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:49:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-10-11 11:49:11,320 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 161 [2024-10-11 11:49:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:11,322 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-10-11 11:49:11,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:49:11,325 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-10-11 11:49:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-11 11:49:11,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:11,330 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:49:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:49:11,331 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -628158489, now seen corresponding path program 1 times [2024-10-11 11:49:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:49:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606259537] [2024-10-11 11:49:11,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:11,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:49:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:49:11,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:49:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:49:11,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:49:11,716 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:49:11,718 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:49:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:49:11,723 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:49:11,836 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:49:11,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:49:11 BoogieIcfgContainer [2024-10-11 11:49:11,839 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:49:11,842 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:49:11,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:49:11,843 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:49:11,843 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:49:09" (3/4) ... [2024-10-11 11:49:11,847 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:49:11,849 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:49:11,850 INFO L158 Benchmark]: Toolchain (without parser) took 3052.74ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 99.9MB in the end (delta: 23.8MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-10-11 11:49:11,850 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 169.9MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:49:11,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.32ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 108.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:49:11,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.93ms. Allocated memory is still 169.9MB. Free memory was 108.5MB in the beginning and 104.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:49:11,853 INFO L158 Benchmark]: Boogie Preprocessor took 77.30ms. Allocated memory is still 169.9MB. Free memory was 104.8MB in the beginning and 101.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:49:11,853 INFO L158 Benchmark]: RCFGBuilder took 636.49ms. Allocated memory is still 169.9MB. Free memory was 101.4MB in the beginning and 76.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 11:49:11,854 INFO L158 Benchmark]: TraceAbstraction took 1894.42ms. Allocated memory is still 169.9MB. Free memory was 75.5MB in the beginning and 101.0MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:49:11,857 INFO L158 Benchmark]: Witness Printer took 6.83ms. Allocated memory is still 169.9MB. Free memory was 101.0MB in the beginning and 99.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:49:11,859 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.20ms. Allocated memory is still 169.9MB. Free memory is still 143.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.32ms. Allocated memory is still 169.9MB. Free memory was 123.7MB in the beginning and 108.5MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.93ms. Allocated memory is still 169.9MB. Free memory was 108.5MB in the beginning and 104.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.30ms. Allocated memory is still 169.9MB. Free memory was 104.8MB in the beginning and 101.4MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 636.49ms. Allocated memory is still 169.9MB. Free memory was 101.4MB in the beginning and 76.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1894.42ms. Allocated memory is still 169.9MB. Free memory was 75.5MB in the beginning and 101.0MB in the end (delta: -25.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.83ms. Allocated memory is still 169.9MB. Free memory was 101.0MB in the beginning and 99.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 someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 1000.6; [L23] float var_1_2 = 255.675; [L24] float var_1_3 = 10.4; [L25] float var_1_4 = 31.4; [L26] double var_1_5 = 7.75; [L27] double var_1_6 = 63.1; [L28] signed char var_1_7 = 32; [L29] signed char var_1_10 = 64; [L30] signed short int var_1_11 = 5; [L31] unsigned short int var_1_12 = 4; [L32] unsigned char var_1_13 = 1; [L33] unsigned short int var_1_14 = 49632; [L34] unsigned short int var_1_15 = 0; [L35] signed char var_1_16 = 50; [L36] signed char var_1_18 = 2; [L37] signed char var_1_19 = 25; [L38] signed char var_1_20 = 10; [L39] signed char var_1_21 = 1; [L40] signed char var_1_22 = 8; [L41] unsigned long int var_1_23 = 25; [L42] unsigned short int var_1_24 = 32; [L43] signed long int var_1_26 = 50; [L44] signed char last_1_var_1_7 = 32; [L45] signed short int last_1_var_1_11 = 5; [L46] signed long int last_1_var_1_26 = 50; [L140] isInitial = 1 [L141] FCALL initially() [L142] int k_loop; [L143] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_2=10227/40, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L143] COND TRUE k_loop < 1 [L144] CALL updateLastVariables() [L131] last_1_var_1_7 = var_1_7 [L132] last_1_var_1_11 = var_1_11 [L133] last_1_var_1_26 = var_1_26 [L144] RET updateLastVariables() [L145] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_float() [L89] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L89] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_3=52/5, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L90] var_1_3 = __VERIFIER_nondet_float() [L91] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L91] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_4=157/5, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L92] var_1_4 = __VERIFIER_nondet_float() [L93] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L93] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L94] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L94] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_5=31/4, var_1_6=631/10, var_1_7=32] [L95] var_1_5 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L96] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_6=631/10, var_1_7=32] [L97] var_1_6 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L98] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=64, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L99] var_1_10 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L100] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L101] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L101] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L102] var_1_13 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L104] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L104] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=49632, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L105] var_1_14 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_14 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L106] RET assume_abort_if_not(var_1_14 >= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L107] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L107] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=0, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L108] var_1_15 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L109] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L110] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L110] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=2, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L111] var_1_18 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_18 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L112] RET assume_abort_if_not(var_1_18 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L113] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L113] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=25, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L114] var_1_19 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L115] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L116] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L116] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=10, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L117] var_1_20 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L118] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L119] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L119] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L121] RET assume_abort_if_not(var_1_21 >= -1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L122] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L122] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=8, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L123] var_1_22 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L124] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L125] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L125] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32, var_1_26=50, var_1_7=32] [L126] var_1_24 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L127] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_26=50, var_1_7=32] [L128] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32] [L128] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=5003/5, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_7=32] [L145] RET updateVariables() [L146] CALL step() [L50] COND TRUE (- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4)) [L51] var_1_1 = ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=5, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L55] COND TRUE var_1_1 > var_1_4 [L56] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=4, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L60] COND TRUE \read(var_1_13) [L61] var_1_12 = (var_1_14 - var_1_15) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L63] signed char stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=50, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L64] COND TRUE var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1) [L65] var_1_16 = ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L73] COND TRUE (- (var_1_14 - var_1_24)) < var_1_10 [L74] var_1_23 = (var_1_24 + (var_1_22 + 4u)) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L78] COND FALSE !(var_1_6 != 49.125) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L83] EXPR var_1_12 & last_1_var_1_7 VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, stepLocal_0=63, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L83] COND FALSE !(-4 > (var_1_12 & last_1_var_1_7)) [L146] RET step() [L147] CALL, EXPR property() [L136] EXPR (((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L136-L137] return ((((((((- 1000.5f) != (var_1_2 * (var_1_3 / var_1_4))) ? (var_1_1 == ((double) ((((var_1_5) > (var_1_6)) ? (var_1_5) : (var_1_6))))) : (var_1_1 == ((double) var_1_5))) && ((-4 > (var_1_12 & last_1_var_1_7)) ? (var_1_7 == ((signed char) var_1_10)) : 1)) && ((var_1_1 > var_1_4) ? (var_1_11 == ((signed short int) var_1_10)) : (var_1_11 == ((signed short int) ((((last_1_var_1_11) < (((16 - 32) + (64 + var_1_10)))) ? (last_1_var_1_11) : (((16 - 32) + (64 + var_1_10))))))))) && (var_1_13 ? (var_1_12 == ((unsigned short int) (var_1_14 - var_1_15))) : 1)) && ((var_1_1 <= (((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))) + var_1_1)) ? (var_1_16 == ((signed char) ((((var_1_10) < ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20))) ? (var_1_10) : ((((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) + var_1_20)))))) : ((var_1_19 < var_1_20) ? (var_1_16 == ((signed char) (var_1_21 - var_1_22))) : (var_1_16 == ((signed char) var_1_10))))) && (((- (var_1_14 - var_1_24)) < var_1_10) ? (var_1_23 == ((unsigned long int) (var_1_24 + (var_1_22 + 4u)))) : (var_1_23 == ((unsigned long int) ((((var_1_14) < (var_1_12)) ? (var_1_14) : (var_1_12))))))) && ((var_1_6 != 49.125) ? ((((((64u) < 0 ) ? -(64u) : (64u))) < last_1_var_1_26) ? (var_1_26 == ((signed long int) var_1_15)) : 1) : 1) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=5, last_1_var_1_26=50, last_1_var_1_7=32, var_1_10=125, var_1_11=125, var_1_12=0, var_1_13=1, var_1_14=-2147385345, var_1_15=32767, var_1_16=125, var_1_18=62, var_1_19=62, var_1_1=49637, var_1_20=63, var_1_21=-1, var_1_22=0, var_1_23=32771, var_1_24=32767, var_1_26=50, var_1_5=49637, var_1_6=49637, var_1_7=32] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 311 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 99 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 212 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 483 NumberOfCodeBlocks, 483 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 320 ConstructedInterpolants, 0 QuantifiedInterpolants, 322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 2600/2600 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-10-11 11:49:11,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:49:14,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:49:14,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:49:14,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:49:14,210 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:49:14,244 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:49:14,245 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:49:14,246 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:49:14,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:49:14,247 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:49:14,248 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:49:14,248 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:49:14,249 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:49:14,249 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:49:14,250 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:49:14,250 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:49:14,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:49:14,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:49:14,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:49:14,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:49:14,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:49:14,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:49:14,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:49:14,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:49:14,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:49:14,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:49:14,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:49:14,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:49:14,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:49:14,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:49:14,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:49:14,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:49:14,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:49:14,263 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:49:14,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:49:14,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:49:14,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:49:14,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:49:14,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:49:14,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:49:14,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:49:14,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:49:14,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:49:14,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:49:14,266 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:49:14,267 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-clean/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-clean/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 -> 9c7856047a8856614d3626f64240352cf62a7e5366932f4184c4906de36152b1 [2024-10-11 11:49:14,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:49:14,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:49:14,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:49:14,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:49:14,663 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:49:14,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-11 11:49:16,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:49:16,443 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:49:16,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-11 11:49:16,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ef2b945e/1500bfe2545d43028ce1d2d564aae9f7/FLAGd861a8153 [2024-10-11 11:49:16,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ef2b945e/1500bfe2545d43028ce1d2d564aae9f7 [2024-10-11 11:49:16,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:49:16,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:49:16,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:49:16,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:49:16,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:49:16,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:16,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3a9f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16, skipping insertion in model container [2024-10-11 11:49:16,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:16,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:49:16,741 WARN L248 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_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-11 11:49:16,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:49:16,846 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:49:16,858 WARN L248 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_loopvsstraightlinecode_50-1loop_file-43.i[915,928] [2024-10-11 11:49:16,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:49:16,923 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:49:16,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16 WrapperNode [2024-10-11 11:49:16,924 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:49:16,925 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:49:16,925 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:49:16,925 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:49:16,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:16,950 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:16,985 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-10-11 11:49:16,990 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:49:16,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:49:16,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:49:16,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:49:17,004 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,028 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-10-11 11:49:17,029 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,029 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,045 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,061 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:49:17,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:49:17,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:49:17,068 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:49:17,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (1/1) ... [2024-10-11 11:49:17,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:49:17,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:49:17,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:49:17,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:49:17,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:49:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:49:17,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:49:17,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:49:17,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:49:17,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:49:17,247 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:49:17,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:49:28,372 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-11 11:49:28,372 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:49:28,448 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:49:28,449 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:49:28,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:49:28 BoogieIcfgContainer [2024-10-11 11:49:28,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:49:28,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:49:28,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:49:28,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:49:28,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:49:16" (1/3) ... [2024-10-11 11:49:28,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dba30fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:49:28, skipping insertion in model container [2024-10-11 11:49:28,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:49:16" (2/3) ... [2024-10-11 11:49:28,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dba30fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:49:28, skipping insertion in model container [2024-10-11 11:49:28,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:49:28" (3/3) ... [2024-10-11 11:49:28,459 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-43.i [2024-10-11 11:49:28,475 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:49:28,475 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:49:28,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:49:28,574 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;@2a47fbd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:49:28,575 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:49:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:49:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 11:49:28,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:28,597 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:49:28,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:28,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:28,605 INFO L85 PathProgramCache]: Analyzing trace with hash -707107454, now seen corresponding path program 1 times [2024-10-11 11:49:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253838878] [2024-10-11 11:49:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:28,622 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-10-11 11:49:28,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:28,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 11:49:28,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:49:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:29,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:49:29,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:29,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 626 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-10-11 11:49:29,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:49:29,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:49:29,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253838878] [2024-10-11 11:49:29,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253838878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:49:29,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:49:29,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:49:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235508340] [2024-10-11 11:49:29,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:49:29,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:49:29,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:49:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:49:29,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:49:29,246 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.4) internal successors, (49), 36 states have internal predecessors, (49), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:49:33,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:49:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:49:33,495 INFO L93 Difference]: Finished difference Result 127 states and 227 transitions. [2024-10-11 11:49:33,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:49:33,500 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 158 [2024-10-11 11:49:33,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:49:33,507 INFO L225 Difference]: With dead ends: 127 [2024-10-11 11:49:33,507 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 11:49:33,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:49:33,514 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:49:33,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 11:49:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 11:49:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-11 11:49:33,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:49:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2024-10-11 11:49:33,559 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 158 [2024-10-11 11:49:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:49:33,560 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2024-10-11 11:49:33,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:49:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2024-10-11 11:49:33,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 11:49:33,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:49:33,567 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-11 11:49:33,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:49:33,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 11:49:33,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:49:33,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:49:33,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1930165504, now seen corresponding path program 1 times [2024-10-11 11:49:33,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:49:33,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780224149] [2024-10-11 11:49:33,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:49:33,774 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-10-11 11:49:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:49:33,778 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 11:49:33,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 11:49:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:49:34,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 11:49:34,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:49:56,397 WARN L286 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:50:04,355 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~var_1_26~0 (_ bv50 32)) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (= (_ bv50 32) c_~last_1_var_1_26~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0))))) is different from false [2024-10-11 11:50:08,383 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~var_1_26~0 (_ bv50 32)) (let ((.cse0 (fp.gt c_~var_1_5~0 c_~var_1_6~0))) (or (and (= c_~var_1_1~0 c_~var_1_6~0) (not .cse0)) (and .cse0 (= c_~var_1_5~0 c_~var_1_1~0)))) (= (_ bv50 32) c_~last_1_var_1_26~0) (not (fp.eq (fp.neg ((_ to_fp 8 24) c_currentRoundingMode (/ 2001.0 2.0))) (fp.mul c_currentRoundingMode c_~var_1_2~0 (fp.div c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0))))) is different from true [2024-10-11 11:50:27,905 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:50:34,933 WARN L286 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 11:50:40,224 WARN L286 SmtUtils]: Spent 5.29s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)