./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d199e7b6b777c136a1c8f1da4791216215da1f7aa9583adf58577835b47cc1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:50:49,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:50:49,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:50:49,796 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:50:49,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:50:49,808 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:50:49,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:50:49,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:50:49,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:50:49,809 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:50:49,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:50:49,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:50:49,809 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:50:49,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:50:49,809 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:50:49,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:50:49,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:50:49,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:50:49,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:50:49,811 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:50:49,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:50:49,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:50:49,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:50:49,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:50:49,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:50:49,811 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d199e7b6b777c136a1c8f1da4791216215da1f7aa9583adf58577835b47cc1e [2025-03-16 23:50:50,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:50:50,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:50:50,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:50:50,046 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:50:50,046 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:50:50,047 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i [2025-03-16 23:50:51,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56df2b364/35f5ca24705a4526a7474cfecf5135bb/FLAG7b55045c5 [2025-03-16 23:50:51,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:50:51,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i [2025-03-16 23:50:51,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56df2b364/35f5ca24705a4526a7474cfecf5135bb/FLAG7b55045c5 [2025-03-16 23:50:51,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56df2b364/35f5ca24705a4526a7474cfecf5135bb [2025-03-16 23:50:51,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:50:51,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:50:51,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:50:51,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:50:51,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:50:51,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dfdcf82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51, skipping insertion in model container [2025-03-16 23:50:51,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:50:51,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i[915,928] [2025-03-16 23:50:51,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:50:51,623 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:50:51,629 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i[915,928] [2025-03-16 23:50:51,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:50:51,666 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:50:51,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51 WrapperNode [2025-03-16 23:50:51,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:50:51,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:50:51,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:50:51,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:50:51,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,695 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2025-03-16 23:50:51,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:50:51,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:50:51,700 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:50:51,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:50:51,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,717 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]. [2025-03-16 23:50:51,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,722 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,723 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,724 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,726 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:50:51,726 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:50:51,727 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:50:51,727 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:50:51,727 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (1/1) ... [2025-03-16 23:50:51,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:50:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:50:51,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:50:51,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:50:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:50:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:50:51,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:50:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:50:51,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:50:51,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:50:51,820 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:50:51,821 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:50:52,078 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:50:52,078 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:50:52,089 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:50:52,089 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:50:52,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:50:52 BoogieIcfgContainer [2025-03-16 23:50:52,089 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:50:52,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:50:52,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:50:52,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:50:52,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:50:51" (1/3) ... [2025-03-16 23:50:52,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b36e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:50:52, skipping insertion in model container [2025-03-16 23:50:52,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:51" (2/3) ... [2025-03-16 23:50:52,097 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b36e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:50:52, skipping insertion in model container [2025-03-16 23:50:52,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:50:52" (3/3) ... [2025-03-16 23:50:52,097 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-15.i [2025-03-16 23:50:52,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:50:52,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-15.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:50:52,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:50:52,163 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;@353db56f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:50:52,163 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:50:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:50:52,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 23:50:52,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:50:52,178 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:50:52,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:50:52,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:50:52,184 INFO L85 PathProgramCache]: Analyzing trace with hash -245047584, now seen corresponding path program 1 times [2025-03-16 23:50:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:50:52,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552815115] [2025-03-16 23:50:52,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:50:52,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:50:52,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:50:52,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:50:52,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:50:52,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:50:52,438 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-16 23:50:52,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:50:52,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552815115] [2025-03-16 23:50:52,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552815115] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:50:52,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307552449] [2025-03-16 23:50:52,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:50:52,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:50:52,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:50:52,444 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:50:52,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 23:50:52,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:50:52,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:50:52,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:50:52,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:50:52,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:50:52,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:50:52,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-16 23:50:52,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:50:52,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307552449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:50:52,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:50:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:50:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128574793] [2025-03-16 23:50:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:50:52,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:50:52,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:50:52,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:50:52,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:50:52,702 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:50:52,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:50:52,726 INFO L93 Difference]: Finished difference Result 151 states and 268 transitions. [2025-03-16 23:50:52,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:50:52,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 184 [2025-03-16 23:50:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:50:52,731 INFO L225 Difference]: With dead ends: 151 [2025-03-16 23:50:52,731 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 23:50:52,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:50:52,734 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:50:52,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:50:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 23:50:52,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-16 23:50:52,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:50:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2025-03-16 23:50:52,766 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 184 [2025-03-16 23:50:52,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:50:52,766 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2025-03-16 23:50:52,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:50:52,766 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2025-03-16 23:50:52,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 23:50:52,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:50:52,769 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:50:52,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 23:50:52,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-16 23:50:52,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:50:52,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:50:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash 601767898, now seen corresponding path program 1 times [2025-03-16 23:50:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:50:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657267808] [2025-03-16 23:50:52,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:50:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:50:52,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:50:53,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:50:53,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:50:53,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:50:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:50:53,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:50:53,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657267808] [2025-03-16 23:50:53,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657267808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:50:53,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:50:53,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:50:53,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499557173] [2025-03-16 23:50:53,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:50:53,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:50:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:50:53,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:50:53,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:50:53,324 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:50:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:50:53,501 INFO L93 Difference]: Finished difference Result 225 states and 348 transitions. [2025-03-16 23:50:53,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:50:53,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2025-03-16 23:50:53,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:50:53,504 INFO L225 Difference]: With dead ends: 225 [2025-03-16 23:50:53,505 INFO L226 Difference]: Without dead ends: 151 [2025-03-16 23:50:53,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:50:53,508 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 64 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:50:53,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 325 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:50:53,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-16 23:50:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 130. [2025-03-16 23:50:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:50:53,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 201 transitions. [2025-03-16 23:50:53,542 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 201 transitions. Word has length 184 [2025-03-16 23:50:53,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:50:53,543 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 201 transitions. [2025-03-16 23:50:53,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:50:53,544 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 201 transitions. [2025-03-16 23:50:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:50:53,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:50:53,546 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:50:53,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:50:53,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:50:53,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:50:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1242008790, now seen corresponding path program 1 times [2025-03-16 23:50:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:50:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358922893] [2025-03-16 23:50:53,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:50:53,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:50:53,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:50:53,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:50:53,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:50:53,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:50:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:50:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:50:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358922893] [2025-03-16 23:50:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358922893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:50:53,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:50:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:50:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929807183] [2025-03-16 23:50:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:50:53,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:50:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:50:53,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:50:53,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:50:53,903 INFO L87 Difference]: Start difference. First operand 130 states and 201 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:50:54,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:50:54,030 INFO L93 Difference]: Finished difference Result 295 states and 445 transitions. [2025-03-16 23:50:54,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:50:54,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2025-03-16 23:50:54,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:50:54,033 INFO L225 Difference]: With dead ends: 295 [2025-03-16 23:50:54,033 INFO L226 Difference]: Without dead ends: 221 [2025-03-16 23:50:54,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:50:54,034 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 119 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:50:54,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 276 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 23:50:54,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-16 23:50:54,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 184. [2025-03-16 23:50:54,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 106 states have internal predecessors, (130), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-16 23:50:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 278 transitions. [2025-03-16 23:50:54,065 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 278 transitions. Word has length 185 [2025-03-16 23:50:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:50:54,066 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 278 transitions. [2025-03-16 23:50:54,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:50:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 278 transitions. [2025-03-16 23:50:54,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:50:54,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:50:54,085 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:50:54,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:50:54,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:50:54,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:50:54,086 INFO L85 PathProgramCache]: Analyzing trace with hash 500801545, now seen corresponding path program 1 times [2025-03-16 23:50:54,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:50:54,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254493091] [2025-03-16 23:50:54,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:50:54,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:50:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:50:54,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:50:54,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:50:54,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:50:54,171 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:50:54,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:50:54,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:50:54,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:50:54,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:50:54,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:50:54,290 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:50:54,291 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:50:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:50:54,294 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-16 23:50:54,414 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:50:54,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:50:54 BoogieIcfgContainer [2025-03-16 23:50:54,418 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:50:54,419 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:50:54,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:50:54,419 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:50:54,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:50:52" (3/4) ... [2025-03-16 23:50:54,421 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:50:54,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:50:54,423 INFO L158 Benchmark]: Toolchain (without parser) took 2966.83ms. Allocated memory is still 142.6MB. Free memory was 106.9MB in the beginning and 51.3MB in the end (delta: 55.6MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2025-03-16 23:50:54,423 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:50:54,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.01ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 92.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:50:54,424 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.04ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:50:54,424 INFO L158 Benchmark]: Boogie Preprocessor took 26.49ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:50:54,424 INFO L158 Benchmark]: IcfgBuilder took 363.02ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 66.8MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:50:54,425 INFO L158 Benchmark]: TraceAbstraction took 2326.70ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 51.3MB in the end (delta: 15.0MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2025-03-16 23:50:54,425 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 51.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:50:54,426 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.13ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.01ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 92.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.04ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 90.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.49ms. Allocated memory is still 142.6MB. Free memory was 90.2MB in the beginning and 87.7MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.02ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 66.8MB in the end (delta: 20.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2326.70ms. Allocated memory is still 142.6MB. Free memory was 66.2MB in the beginning and 51.3MB in the end (delta: 15.0MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 142.6MB. Free memory was 51.3MB in the beginning and 51.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 74, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 119, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 171, overapproximation of someUnaryDOUBLEoperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 171, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed short int var_1_27 = 64; [L44] unsigned char var_1_28 = 8; [L45] unsigned char var_1_29 = 5; [L46] unsigned short int var_1_30 = 100; [L47] signed long int var_1_31 = 8; [L48] unsigned short int var_1_32 = 50; [L49] unsigned char var_1_33 = 0; [L50] unsigned char var_1_34 = 0; [L51] unsigned char var_1_35 = 1; [L52] unsigned char var_1_36 = 0; [L53] signed char last_1_var_1_10 = -5; [L54] signed long int last_1_var_1_21 = 1; [L55] signed long int last_1_var_1_25 = -4; [L175] isInitial = 1 [L176] FCALL initially() [L177] COND TRUE 1 [L178] CALL updateLastVariables() [L166] last_1_var_1_10 = var_1_10 [L167] last_1_var_1_21 = var_1_21 [L168] last_1_var_1_25 = var_1_25 [L178] RET updateLastVariables() [L179] CALL updateVariables() [L116] var_1_3 = __VERIFIER_nondet_float() [L117] 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L117] 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L118] var_1_4 = __VERIFIER_nondet_float() [L119] 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=10, var_1_8=64, var_1_9=256] [L119] 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=10, var_1_8=64, var_1_9=256] [L120] var_1_7 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=64, var_1_9=256] [L121] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=64, var_1_9=256] [L122] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=64, var_1_9=256] [L122] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=64, var_1_9=256] [L123] var_1_8 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=256] [L124] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=256] [L125] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=256] [L125] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=256] [L126] var_1_9 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L127] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L128] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L128] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L129] var_1_11 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L130] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L131] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L131] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L132] var_1_13 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L133] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L134] var_1_14 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L135] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L136] var_1_15 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L137] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L138] var_1_16 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L139] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L140] var_1_20 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L141] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L142] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L142] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L143] var_1_22 = __VERIFIER_nondet_short() [L144] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L144] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L145] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L145] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L146] var_1_23 = __VERIFIER_nondet_short() [L147] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L147] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L148] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L148] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=64, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L149] var_1_27 = __VERIFIER_nondet_short() [L150] CALL assume_abort_if_not(var_1_27 >= -32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L150] RET assume_abort_if_not(var_1_27 >= -32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L151] CALL assume_abort_if_not(var_1_27 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L151] RET assume_abort_if_not(var_1_27 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=5, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L152] var_1_29 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L153] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L154] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L154] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L155] var_1_34 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L156] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L157] CALL assume_abort_if_not(var_1_34 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L157] RET assume_abort_if_not(var_1_34 <= 1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L158] var_1_35 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L159] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L160] CALL assume_abort_if_not(var_1_35 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L160] RET assume_abort_if_not(var_1_35 <= 1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=0, var_1_7=16383, var_1_8=-1, var_1_9=126] [L161] var_1_36 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_36 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L162] RET assume_abort_if_not(var_1_36 >= 1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L163] CALL assume_abort_if_not(var_1_36 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L163] RET assume_abort_if_not(var_1_36 <= 1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_27=0, var_1_28=8, var_1_29=0, var_1_30=100, var_1_31=8, var_1_32=50, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L179] RET updateVariables() [L180] CALL step() [L59] var_1_26 = var_1_27 [L60] var_1_28 = var_1_29 [L61] var_1_30 = var_1_29 [L62] var_1_31 = -128 [L63] var_1_32 = var_1_28 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=0, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L64] COND TRUE \read(var_1_34) [L65] var_1_33 = (((var_1_26 < var_1_30) || var_1_35) || var_1_36) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L67] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L68] COND TRUE var_1_11 <= last_1_var_1_25 [L69] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L72] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L73] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L74] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L78] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L79] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L86] COND FALSE !(\read(var_1_19)) [L89] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L91] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L92] COND TRUE var_1_19 || stepLocal_0 [L93] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L97] signed long int stepLocal_3 = var_1_22 + var_1_11; [L98] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=16256, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L99] COND FALSE !(\read(var_1_20)) [L112] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-127, stepLocal_3=16256, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=126, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L180] RET step() [L181] CALL, EXPR property() [L171-L172] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; [L181] RET, EXPR property() [L181] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=126, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=126, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=-128, var_1_32=0, var_1_33=1, var_1_34=1, var_1_35=1, var_1_36=1, var_1_7=16383, var_1_8=-1, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 150 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 183 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 717 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 340 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 377 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 922 NumberOfCodeBlocks, 922 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 733 ConstructedInterpolants, 0 QuantifiedInterpolants, 1077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 6902/6960 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-16 23:50:54,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6d199e7b6b777c136a1c8f1da4791216215da1f7aa9583adf58577835b47cc1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:50:56,200 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:50:56,278 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:50:56,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:50:56,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:50:56,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:50:56,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:50:56,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:50:56,307 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:50:56,307 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:50:56,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:50:56,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:50:56,308 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:50:56,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:50:56,308 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:50:56,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:50:56,309 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:50:56,310 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:50:56,310 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:50:56,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:50:56,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:50:56,310 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:50:56,310 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:50:56,310 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:50:56,311 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:50:56,311 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6d199e7b6b777c136a1c8f1da4791216215da1f7aa9583adf58577835b47cc1e [2025-03-16 23:50:56,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:50:56,567 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:50:56,569 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:50:56,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:50:56,571 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:50:56,573 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i [2025-03-16 23:50:57,730 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe2220c2/69396c31fb8e45d09250c6c7208e660f/FLAG020e82fbb [2025-03-16 23:50:57,911 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:50:57,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i [2025-03-16 23:50:57,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe2220c2/69396c31fb8e45d09250c6c7208e660f/FLAG020e82fbb [2025-03-16 23:50:58,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfe2220c2/69396c31fb8e45d09250c6c7208e660f [2025-03-16 23:50:58,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:50:58,291 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:50:58,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:50:58,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:50:58,295 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:50:58,296 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,296 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49232833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58, skipping insertion in model container [2025-03-16 23:50:58,296 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:50:58,415 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i[915,928] [2025-03-16 23:50:58,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:50:58,482 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:50:58,493 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-15.i[915,928] [2025-03-16 23:50:58,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:50:58,540 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:50:58,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58 WrapperNode [2025-03-16 23:50:58,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:50:58,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:50:58,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:50:58,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:50:58,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,581 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2025-03-16 23:50:58,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:50:58,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:50:58,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:50:58,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:50:58,587 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,590 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,598 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]. [2025-03-16 23:50:58,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,607 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:50:58,612 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:50:58,612 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:50:58,612 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:50:58,613 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (1/1) ... [2025-03-16 23:50:58,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:50:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:50:58,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 23:50:58,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 23:50:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:50:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:50:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:50:58,660 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:50:58,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:50:58,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:50:58,736 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:50:58,738 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:51:02,038 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-16 23:51:02,039 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:51:02,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:51:02,047 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:51:02,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:51:02 BoogieIcfgContainer [2025-03-16 23:51:02,048 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:51:02,049 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:51:02,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:51:02,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:51:02,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:50:58" (1/3) ... [2025-03-16 23:51:02,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd86dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:51:02, skipping insertion in model container [2025-03-16 23:51:02,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:50:58" (2/3) ... [2025-03-16 23:51:02,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd86dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:51:02, skipping insertion in model container [2025-03-16 23:51:02,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:51:02" (3/3) ... [2025-03-16 23:51:02,056 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-15.i [2025-03-16 23:51:02,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:51:02,067 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-15.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:51:02,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:51:02,106 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;@7aaef0aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:51:02,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:51:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:51:02,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 23:51:02,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:02,116 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:02,116 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:02,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash -245047584, now seen corresponding path program 1 times [2025-03-16 23:51:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:51:02,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461996778] [2025-03-16 23:51:02,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:02,131 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 [2025-03-16 23:51:02,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:51:02,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:51:02,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-16 23:51:02,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:51:02,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:51:02,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:02,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:02,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:51:02,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2025-03-16 23:51:02,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:51:02,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:51:02,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461996778] [2025-03-16 23:51:02,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461996778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:51:02,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:51:02,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:51:02,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387822575] [2025-03-16 23:51:02,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:51:02,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:51:02,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:51:02,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:51:02,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:51:02,540 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:51:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:02,562 INFO L93 Difference]: Finished difference Result 151 states and 268 transitions. [2025-03-16 23:51:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:51:02,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 184 [2025-03-16 23:51:02,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:02,567 INFO L225 Difference]: With dead ends: 151 [2025-03-16 23:51:02,567 INFO L226 Difference]: Without dead ends: 75 [2025-03-16 23:51:02,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:51:02,571 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:02,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:51:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-16 23:51:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-16 23:51:02,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-16 23:51:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 116 transitions. [2025-03-16 23:51:02,609 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 116 transitions. Word has length 184 [2025-03-16 23:51:02,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:02,610 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 116 transitions. [2025-03-16 23:51:02,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-16 23:51:02,610 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 116 transitions. [2025-03-16 23:51:02,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-16 23:51:02,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:02,613 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:02,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:51:02,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:51:02,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:02,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 601767898, now seen corresponding path program 1 times [2025-03-16 23:51:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:51:02,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955625780] [2025-03-16 23:51:02,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:02,816 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 [2025-03-16 23:51:02,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:51:02,818 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:51:02,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-16 23:51:02,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-16 23:51:03,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-16 23:51:03,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:03,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:03,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 23:51:03,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:04,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:51:04,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:51:04,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:51:04,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955625780] [2025-03-16 23:51:04,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955625780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:51:04,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:51:04,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:51:04,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359448641] [2025-03-16 23:51:04,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:51:04,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:51:04,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:51:04,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:51:04,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:51:04,390 INFO L87 Difference]: Start difference. First operand 75 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:51:07,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:51:07,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:07,878 INFO L93 Difference]: Finished difference Result 224 states and 347 transitions. [2025-03-16 23:51:07,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:51:07,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 184 [2025-03-16 23:51:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:07,899 INFO L225 Difference]: With dead ends: 224 [2025-03-16 23:51:07,899 INFO L226 Difference]: Without dead ends: 150 [2025-03-16 23:51:07,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:51:07,900 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 58 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:07,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 327 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 23:51:07,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-16 23:51:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 130. [2025-03-16 23:51:07,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 67 states have (on average 1.208955223880597) internal successors, (81), 67 states have internal predecessors, (81), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:51:07,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 201 transitions. [2025-03-16 23:51:07,934 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 201 transitions. Word has length 184 [2025-03-16 23:51:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 201 transitions. [2025-03-16 23:51:07,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:51:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 201 transitions. [2025-03-16 23:51:07,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:51:07,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:07,938 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:07,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:51:08,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:51:08,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:08,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:08,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1242008790, now seen corresponding path program 1 times [2025-03-16 23:51:08,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:51:08,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045624520] [2025-03-16 23:51:08,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:08,140 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 [2025-03-16 23:51:08,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:51:08,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:51:08,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-16 23:51:08,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:51:08,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:51:08,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:08,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:08,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 23:51:08,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-16 23:51:09,863 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:51:09,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:51:09,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045624520] [2025-03-16 23:51:09,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045624520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:51:09,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:51:09,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:51:09,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154809292] [2025-03-16 23:51:09,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:51:09,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 23:51:09,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:51:09,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 23:51:09,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 23:51:09,865 INFO L87 Difference]: Start difference. First operand 130 states and 201 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:51:15,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 23:51:16,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 23:51:24,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 23:51:25,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-16 23:51:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:25,578 INFO L93 Difference]: Finished difference Result 278 states and 431 transitions. [2025-03-16 23:51:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 23:51:25,595 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 185 [2025-03-16 23:51:25,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:25,597 INFO L225 Difference]: With dead ends: 278 [2025-03-16 23:51:25,597 INFO L226 Difference]: Without dead ends: 204 [2025-03-16 23:51:25,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:51:25,598 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 84 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:25,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 303 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2025-03-16 23:51:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-16 23:51:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 132. [2025-03-16 23:51:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 69 states have internal predecessors, (83), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:51:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-03-16 23:51:25,630 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 185 [2025-03-16 23:51:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:25,631 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-03-16 23:51:25,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-16 23:51:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-03-16 23:51:25,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-16 23:51:25,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:25,635 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:25,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-16 23:51:25,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:51:25,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:25,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1256007147, now seen corresponding path program 1 times [2025-03-16 23:51:25,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:51:25,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1051081706] [2025-03-16 23:51:25,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:25,837 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 [2025-03-16 23:51:25,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:51:25,839 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:51:25,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-16 23:51:25,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-16 23:51:26,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-16 23:51:26,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:26,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:26,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:51:26,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 896 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-03-16 23:51:27,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:51:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-16 23:51:28,470 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:51:28,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1051081706] [2025-03-16 23:51:28,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1051081706] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:51:28,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:51:28,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-16 23:51:28,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636978287] [2025-03-16 23:51:28,470 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:51:28,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 23:51:28,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:51:28,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 23:51:28,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-16 23:51:28,472 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-16 23:51:31,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:51:34,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:51:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:35,612 INFO L93 Difference]: Finished difference Result 298 states and 447 transitions. [2025-03-16 23:51:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 23:51:35,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 185 [2025-03-16 23:51:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:35,627 INFO L225 Difference]: With dead ends: 298 [2025-03-16 23:51:35,627 INFO L226 Difference]: Without dead ends: 222 [2025-03-16 23:51:35,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-03-16 23:51:35,628 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 249 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:35,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 285 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-03-16 23:51:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-16 23:51:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 138. [2025-03-16 23:51:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 73 states have (on average 1.178082191780822) internal successors, (86), 73 states have internal predecessors, (86), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:51:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 206 transitions. [2025-03-16 23:51:35,651 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 206 transitions. Word has length 185 [2025-03-16 23:51:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:35,652 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 206 transitions. [2025-03-16 23:51:35,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-03-16 23:51:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 206 transitions. [2025-03-16 23:51:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:51:35,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:35,653 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:35,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-16 23:51:35,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:51:35,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:35,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:35,855 INFO L85 PathProgramCache]: Analyzing trace with hash 282542136, now seen corresponding path program 1 times [2025-03-16 23:51:35,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:51:35,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925202690] [2025-03-16 23:51:35,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:35,855 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 [2025-03-16 23:51:35,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:51:35,857 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:51:35,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-16 23:51:35,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:51:36,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:51:36,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:36,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:36,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:51:36,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:36,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-03-16 23:51:36,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:51:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-16 23:51:36,925 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:51:36,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925202690] [2025-03-16 23:51:36,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925202690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:51:36,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:51:36,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-16 23:51:36,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715839477] [2025-03-16 23:51:36,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:51:36,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:51:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:51:36,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:51:36,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:51:36,927 INFO L87 Difference]: Start difference. First operand 138 states and 206 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-16 23:51:39,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:51:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:40,509 INFO L93 Difference]: Finished difference Result 229 states and 331 transitions. [2025-03-16 23:51:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:51:40,528 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 186 [2025-03-16 23:51:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:40,529 INFO L225 Difference]: With dead ends: 229 [2025-03-16 23:51:40,529 INFO L226 Difference]: Without dead ends: 151 [2025-03-16 23:51:40,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:51:40,530 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 80 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:40,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 171 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-16 23:51:40,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-16 23:51:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2025-03-16 23:51:40,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:51:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 203 transitions. [2025-03-16 23:51:40,557 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 203 transitions. Word has length 186 [2025-03-16 23:51:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:40,557 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 203 transitions. [2025-03-16 23:51:40,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-16 23:51:40,558 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 203 transitions. [2025-03-16 23:51:40,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:51:40,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:40,559 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:40,571 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-16 23:51:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:51:40,760 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash 217898008, now seen corresponding path program 1 times [2025-03-16 23:51:40,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:51:40,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532917247] [2025-03-16 23:51:40,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:40,760 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 [2025-03-16 23:51:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:51:40,763 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:51:40,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-16 23:51:40,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:51:41,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:51:41,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:41,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:41,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 23:51:41,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:51:41,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-03-16 23:51:41,391 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:51:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-16 23:51:41,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:51:41,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532917247] [2025-03-16 23:51:41,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532917247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:51:41,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:51:41,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-16 23:51:41,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588591440] [2025-03-16 23:51:41,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:51:41,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:51:41,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:51:41,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:51:41,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:51:41,789 INFO L87 Difference]: Start difference. First operand 143 states and 203 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-16 23:51:44,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:51:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:51:44,836 INFO L93 Difference]: Finished difference Result 230 states and 322 transitions. [2025-03-16 23:51:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:51:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 186 [2025-03-16 23:51:44,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:51:44,857 INFO L225 Difference]: With dead ends: 230 [2025-03-16 23:51:44,857 INFO L226 Difference]: Without dead ends: 151 [2025-03-16 23:51:44,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 363 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:51:44,858 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 105 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-16 23:51:44,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 172 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-16 23:51:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-16 23:51:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2025-03-16 23:51:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-16 23:51:44,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 202 transitions. [2025-03-16 23:51:44,874 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 202 transitions. Word has length 186 [2025-03-16 23:51:44,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:51:44,874 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 202 transitions. [2025-03-16 23:51:44,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-03-16 23:51:44,874 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 202 transitions. [2025-03-16 23:51:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-16 23:51:44,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:51:44,875 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:51:44,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-16 23:51:45,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:51:45,076 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:51:45,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:51:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 246527159, now seen corresponding path program 1 times [2025-03-16 23:51:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:51:45,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590500812] [2025-03-16 23:51:45,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:51:45,077 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 [2025-03-16 23:51:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:51:45,079 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-16 23:51:45,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-16 23:51:45,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-16 23:51:45,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-16 23:51:45,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:51:45,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:51:45,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 23:51:45,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:52:26,409 WARN L286 SmtUtils]: Spent 13.52s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)