./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_operatoramount_amount100_file-99.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 8407555b2f77085f3aee4d6c3624a1f27ddb5ca7ca65bbc521a0be32e1f17ee0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:02:31,674 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:02:31,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:02:31,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:02:31,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:02:31,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:02:31,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:02:31,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:02:31,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:02:31,767 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:02:31,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:02:31,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:02:31,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:02:31,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:02:31,769 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:02:31,769 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:02:31,769 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:02:31,769 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:02:31,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:02:31,770 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:02:31,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:02:31,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:31,771 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:02:31,771 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:02:31,771 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:02:31,771 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:02:31,771 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:02:31,771 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:02:31,772 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:02:31,772 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:02:31,772 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:02:31,772 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:02:31,772 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 -> 8407555b2f77085f3aee4d6c3624a1f27ddb5ca7ca65bbc521a0be32e1f17ee0 [2025-03-04 00:02:32,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:02:32,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:02:32,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:02:32,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:02:32,139 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:02:32,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i [2025-03-04 00:02:33,979 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2918d37bd/a14d3f9a45324e6d96b238fd29b36d7f/FLAG51570cde1 [2025-03-04 00:02:34,415 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:02:34,416 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i [2025-03-04 00:02:34,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2918d37bd/a14d3f9a45324e6d96b238fd29b36d7f/FLAG51570cde1 [2025-03-04 00:02:34,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2918d37bd/a14d3f9a45324e6d96b238fd29b36d7f [2025-03-04 00:02:34,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:02:34,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:02:34,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:34,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:02:34,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:02:34,489 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:34" (1/1) ... [2025-03-04 00:02:34,490 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34511160 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:34, skipping insertion in model container [2025-03-04 00:02:34,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:34" (1/1) ... [2025-03-04 00:02:34,528 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:02:34,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i[916,929] [2025-03-04 00:02:34,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:34,921 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:02:34,938 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i[916,929] [2025-03-04 00:02:35,017 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:35,049 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:02:35,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35 WrapperNode [2025-03-04 00:02:35,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:35,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:35,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:02:35,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:02:35,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,150 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-04 00:02:35,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:35,151 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:02:35,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:02:35,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:02:35,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,222 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-04 00:02:35,229 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,229 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,251 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:02:35,284 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:02:35,284 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:02:35,284 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:02:35,286 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (1/1) ... [2025-03-04 00:02:35,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:35,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:35,347 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-04 00:02:35,358 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-04 00:02:35,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:02:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:02:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:02:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:02:35,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:02:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:02:35,522 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:02:35,524 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:02:36,294 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-04 00:02:36,298 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:02:36,320 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:02:36,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:02:36,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:36 BoogieIcfgContainer [2025-03-04 00:02:36,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:02:36,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:02:36,327 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:02:36,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:02:36,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:02:34" (1/3) ... [2025-03-04 00:02:36,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4cd326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:36, skipping insertion in model container [2025-03-04 00:02:36,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:35" (2/3) ... [2025-03-04 00:02:36,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4cd326 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:36, skipping insertion in model container [2025-03-04 00:02:36,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:36" (3/3) ... [2025-03-04 00:02:36,342 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-99.i [2025-03-04 00:02:36,370 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:02:36,375 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-99.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:02:36,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:02:36,503 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;@26ef0aa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:02:36,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:02:36,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 00:02:36,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 00:02:36,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:36,575 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:36,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:36,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-04 00:02:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882051852] [2025-03-04 00:02:36,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:36,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:36,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 00:02:36,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 00:02:36,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:36,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:37,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-04 00:02:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882051852] [2025-03-04 00:02:37,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882051852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:02:37,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381170225] [2025-03-04 00:02:37,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:37,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:02:37,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:37,209 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-04 00:02:37,211 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-04 00:02:37,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 00:02:37,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 00:02:37,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:37,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:37,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:02:37,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-04 00:02:37,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381170225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:37,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:02:37,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:02:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362794025] [2025-03-04 00:02:37,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:37,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:02:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:37,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:02:37,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:02:37,569 INFO L87 Difference]: Start difference. First operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 00:02:37,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:37,618 INFO L93 Difference]: Finished difference Result 170 states and 296 transitions. [2025-03-04 00:02:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:02:37,621 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-04 00:02:37,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:37,633 INFO L225 Difference]: With dead ends: 170 [2025-03-04 00:02:37,635 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 00:02:37,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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-04 00:02:37,649 INFO L435 NwaCegarLoop]: 132 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, 132 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-04 00:02:37,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:02:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 00:02:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 00:02:37,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 00:02:37,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-04 00:02:37,734 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-04 00:02:37,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:37,739 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-04 00:02:37,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 00:02:37,739 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-04 00:02:37,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 00:02:37,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:37,747 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:37,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:02:37,949 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-04 00:02:37,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:37,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-04 00:02:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153639046] [2025-03-04 00:02:37,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:37,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:37,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 00:02:38,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 00:02:38,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:38,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:38,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:38,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:38,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153639046] [2025-03-04 00:02:38,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153639046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:38,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:38,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:02:38,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894762681] [2025-03-04 00:02:38,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:38,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:02:38,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:38,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:02:38,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:02:38,903 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:39,002 INFO L93 Difference]: Finished difference Result 249 states and 390 transitions. [2025-03-04 00:02:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:02:39,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-04 00:02:39,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:39,009 INFO L225 Difference]: With dead ends: 249 [2025-03-04 00:02:39,009 INFO L226 Difference]: Without dead ends: 167 [2025-03-04 00:02:39,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:02:39,014 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:39,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 258 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:02:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-04 00:02:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2025-03-04 00:02:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.4107142857142858) internal successors, (158), 112 states have internal predecessors, (158), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:02:39,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 258 transitions. [2025-03-04 00:02:39,091 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 258 transitions. Word has length 166 [2025-03-04 00:02:39,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:39,097 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 258 transitions. [2025-03-04 00:02:39,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 258 transitions. [2025-03-04 00:02:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 00:02:39,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:39,100 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:39,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:02:39,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:39,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash -418941022, now seen corresponding path program 1 times [2025-03-04 00:02:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383912486] [2025-03-04 00:02:39,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:39,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 00:02:39,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 00:02:39,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:39,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:40,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:40,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383912486] [2025-03-04 00:02:40,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383912486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:40,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:40,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:02:40,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145207852] [2025-03-04 00:02:40,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:40,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:02:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:40,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:02:40,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:02:40,145 INFO L87 Difference]: Start difference. First operand 165 states and 258 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:40,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:40,660 INFO L93 Difference]: Finished difference Result 432 states and 676 transitions. [2025-03-04 00:02:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:02:40,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-04 00:02:40,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:40,668 INFO L225 Difference]: With dead ends: 432 [2025-03-04 00:02:40,668 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 00:02:40,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:02:40,675 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 102 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:40,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 448 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:02:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 00:02:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 212. [2025-03-04 00:02:40,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 133 states have internal predecessors, (179), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 00:02:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 329 transitions. [2025-03-04 00:02:40,772 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 329 transitions. Word has length 167 [2025-03-04 00:02:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:40,773 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 329 transitions. [2025-03-04 00:02:40,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 329 transitions. [2025-03-04 00:02:40,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 00:02:40,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:40,782 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:40,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:02:40,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:40,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:40,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1816891301, now seen corresponding path program 1 times [2025-03-04 00:02:40,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:40,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135116912] [2025-03-04 00:02:40,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:40,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:40,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 00:02:40,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 00:02:40,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:40,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:41,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:41,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135116912] [2025-03-04 00:02:41,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135116912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:41,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:41,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:02:41,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616062621] [2025-03-04 00:02:41,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:41,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:02:41,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:41,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:02:41,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:02:41,193 INFO L87 Difference]: Start difference. First operand 212 states and 329 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:41,436 INFO L93 Difference]: Finished difference Result 432 states and 675 transitions. [2025-03-04 00:02:41,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:02:41,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-04 00:02:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:41,439 INFO L225 Difference]: With dead ends: 432 [2025-03-04 00:02:41,439 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 00:02:41,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:02:41,441 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 100 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:41,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 503 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:02:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 00:02:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 213. [2025-03-04 00:02:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 134 states have (on average 1.3432835820895523) internal successors, (180), 134 states have internal predecessors, (180), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 00:02:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 330 transitions. [2025-03-04 00:02:41,484 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 330 transitions. Word has length 168 [2025-03-04 00:02:41,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:41,485 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 330 transitions. [2025-03-04 00:02:41,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 330 transitions. [2025-03-04 00:02:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 00:02:41,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:41,490 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:41,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:02:41,490 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:41,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:41,491 INFO L85 PathProgramCache]: Analyzing trace with hash 66997254, now seen corresponding path program 1 times [2025-03-04 00:02:41,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:41,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152958638] [2025-03-04 00:02:41,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:41,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:41,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 00:02:41,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 00:02:41,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:41,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:42,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:42,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:42,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152958638] [2025-03-04 00:02:42,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152958638] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:42,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:42,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 00:02:42,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390477135] [2025-03-04 00:02:42,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:42,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:02:42,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:42,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:02:42,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:02:42,214 INFO L87 Difference]: Start difference. First operand 213 states and 330 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:42,655 INFO L93 Difference]: Finished difference Result 432 states and 674 transitions. [2025-03-04 00:02:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:02:42,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-03-04 00:02:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:42,659 INFO L225 Difference]: With dead ends: 432 [2025-03-04 00:02:42,664 INFO L226 Difference]: Without dead ends: 270 [2025-03-04 00:02:42,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:02:42,666 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 84 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:42,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 436 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:02:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-03-04 00:02:42,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 214. [2025-03-04 00:02:42,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 135 states have internal predecessors, (181), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 00:02:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 331 transitions. [2025-03-04 00:02:42,742 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 331 transitions. Word has length 169 [2025-03-04 00:02:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:42,744 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 331 transitions. [2025-03-04 00:02:42,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 331 transitions. [2025-03-04 00:02:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 00:02:42,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:42,751 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:42,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:02:42,752 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:42,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:42,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1971059035, now seen corresponding path program 1 times [2025-03-04 00:02:42,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:42,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057758537] [2025-03-04 00:02:42,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:42,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:42,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 00:02:42,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 00:02:42,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:42,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:02:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057758537] [2025-03-04 00:02:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057758537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:43,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:02:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347907421] [2025-03-04 00:02:43,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:02:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:02:43,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:02:43,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:02:43,284 INFO L87 Difference]: Start difference. First operand 214 states and 331 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:43,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:43,401 INFO L93 Difference]: Finished difference Result 410 states and 636 transitions. [2025-03-04 00:02:43,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:02:43,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-03-04 00:02:43,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:43,409 INFO L225 Difference]: With dead ends: 410 [2025-03-04 00:02:43,412 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 00:02:43,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:02:43,414 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:43,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 248 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:02:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 00:02:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 214. [2025-03-04 00:02:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 135 states have (on average 1.325925925925926) internal successors, (179), 135 states have internal predecessors, (179), 75 states have call successors, (75), 3 states have call predecessors, (75), 3 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 00:02:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 329 transitions. [2025-03-04 00:02:43,482 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 329 transitions. Word has length 169 [2025-03-04 00:02:43,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:43,482 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 329 transitions. [2025-03-04 00:02:43,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:43,483 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 329 transitions. [2025-03-04 00:02:43,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 00:02:43,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:43,488 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:43,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:02:43,488 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:43,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-04 00:02:43,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:02:43,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167618614] [2025-03-04 00:02:43,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:43,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:02:43,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 00:02:43,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 00:02:43,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:43,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:02:43,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:02:43,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 00:02:44,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 00:02:44,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:44,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:02:44,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:02:44,178 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:02:44,179 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:02:44,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:02:44,187 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:02:44,374 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:02:44,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:02:44 BoogieIcfgContainer [2025-03-04 00:02:44,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:02:44,384 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:02:44,384 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:02:44,384 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:02:44,389 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:36" (3/4) ... [2025-03-04 00:02:44,391 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:02:44,393 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:02:44,396 INFO L158 Benchmark]: Toolchain (without parser) took 9915.82ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 113.8MB in the beginning and 120.3MB in the end (delta: -6.5MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2025-03-04 00:02:44,397 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:44,398 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.29ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 96.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:02:44,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.62ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 90.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:44,398 INFO L158 Benchmark]: Boogie Preprocessor took 132.58ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 79.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:44,398 INFO L158 Benchmark]: IcfgBuilder took 1040.42ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 48.4MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 00:02:44,398 INFO L158 Benchmark]: TraceAbstraction took 8056.68ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 47.8MB in the beginning and 122.6MB in the end (delta: -74.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:02:44,398 INFO L158 Benchmark]: Witness Printer took 9.11ms. Allocated memory is still 218.1MB. Free memory was 122.6MB in the beginning and 120.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:02:44,399 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.18ms. Allocated memory is still 226.5MB. Free memory is still 148.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 574.29ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 96.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.62ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 90.8MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.58ms. Allocated memory is still 142.6MB. Free memory was 90.8MB in the beginning and 79.5MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1040.42ms. Allocated memory is still 142.6MB. Free memory was 79.5MB in the beginning and 48.4MB in the end (delta: 31.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8056.68ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 47.8MB in the beginning and 122.6MB in the end (delta: -74.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 9.11ms. Allocated memory is still 218.1MB. Free memory was 122.6MB in the beginning and 120.3MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryFLOATComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 215, overapproximation of someBinaryFLOATComparisonOperation at line 190, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 184. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 8; [L23] unsigned char var_1_4 = 200; [L24] unsigned char var_1_5 = 0; [L25] unsigned long int var_1_6 = 1000000; [L26] signed short int var_1_7 = -1; [L27] unsigned char var_1_8 = 1; [L28] unsigned char var_1_9 = 0; [L29] signed short int var_1_10 = 128; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_14 = 128; [L32] unsigned char var_1_15 = 25; [L33] unsigned char var_1_16 = 1; [L34] float var_1_17 = 1.25; [L35] float var_1_18 = 3.5; [L36] float var_1_19 = 127.45; [L37] float var_1_20 = 1.5; [L38] float var_1_21 = 24.4; [L39] float var_1_22 = 0.8; [L40] unsigned char var_1_23 = 4; [L41] unsigned char var_1_24 = 0; [L42] unsigned char var_1_25 = 8; [L43] unsigned char var_1_26 = 64; [L44] signed short int var_1_27 = 256; [L45] unsigned char var_1_28 = 1; [L46] unsigned char var_1_30 = 0; [L47] unsigned char var_1_31 = 0; [L48] unsigned char last_1_var_1_1 = 8; [L49] unsigned long int last_1_var_1_6 = 1000000; [L50] signed short int last_1_var_1_7 = -1; [L51] unsigned char last_1_var_1_12 = 1; [L52] float last_1_var_1_17 = 1.25; [L53] unsigned char last_1_var_1_23 = 4; [L54] unsigned char last_1_var_1_25 = 8; [L55] unsigned char last_1_var_1_28 = 1; VAL [isInitial=0, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L219] isInitial = 1 [L220] FCALL initially() [L221] COND TRUE 1 [L222] CALL updateLastVariables() [L205] last_1_var_1_1 = var_1_1 [L206] last_1_var_1_6 = var_1_6 [L207] last_1_var_1_7 = var_1_7 [L208] last_1_var_1_12 = var_1_12 [L209] last_1_var_1_17 = var_1_17 [L210] last_1_var_1_23 = var_1_23 [L211] last_1_var_1_25 = var_1_25 [L212] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=200, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L222] RET updateLastVariables() [L223] CALL updateVariables() [L163] var_1_4 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L164] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L165] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=0, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L166] var_1_5 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L167] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L168] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L169] var_1_9 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L170] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1] [L171] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L171] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=128, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L172] var_1_14 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_14 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L173] RET assume_abort_if_not(var_1_14 >= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L174] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=25, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L175] var_1_15 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L176] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L177] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L178] var_1_16 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L179] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L180] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_18=7/2, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L181] var_1_18 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L182] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_19=2549/20, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L183] var_1_19 = __VERIFIER_nondet_float() [L184] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L184] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_20=3/2, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L185] var_1_20 = __VERIFIER_nondet_float() [L186] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L186] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_21=122/5, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L187] var_1_21 = __VERIFIER_nondet_float() [L188] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L188] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_22=4/5, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L189] var_1_22 = __VERIFIER_nondet_float() [L190] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L190] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L191] var_1_24 = __VERIFIER_nondet_uchar() [L192] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L192] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L193] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L193] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=64, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L194] var_1_26 = __VERIFIER_nondet_uchar() [L195] CALL assume_abort_if_not(var_1_26 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L195] RET assume_abort_if_not(var_1_26 >= 63) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L196] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L196] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L197] var_1_30 = __VERIFIER_nondet_uchar() [L198] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L198] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L199] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L199] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=0, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L200] var_1_31 = __VERIFIER_nondet_uchar() [L201] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L201] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L202] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L202] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L223] RET updateVariables() [L224] CALL step() [L59] signed long int stepLocal_5 = last_1_var_1_7; [L60] signed long int stepLocal_4 = last_1_var_1_7; [L61] signed long int stepLocal_3 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_4=-1, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L62] COND TRUE stepLocal_4 > last_1_var_1_6 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, stepLocal_5=-1, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L63] COND TRUE stepLocal_5 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_3=8, var_1_10=128, var_1_12=1, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L64] COND FALSE !(stepLocal_3 <= last_1_var_1_12) [L67] var_1_12 = (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=1, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L73] COND FALSE !(last_1_var_1_25 < last_1_var_1_1) [L80] var_1_28 = var_1_31 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=8, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L82] COND FALSE !(var_1_21 != var_1_19) [L89] var_1_25 = (var_1_14 - (var_1_26 - var_1_24)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L91] unsigned char stepLocal_0 = ! var_1_28; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_0=0, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L92] COND FALSE !(stepLocal_0 && var_1_28) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=8, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L95] COND TRUE \read(var_1_28) [L96] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=-1, var_1_8=1, var_1_9=0] [L101] var_1_7 = var_1_5 [L102] unsigned char stepLocal_2 = var_1_12; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_2=0, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=1, var_1_9=0] [L103] COND TRUE stepLocal_2 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12))) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=1, var_1_9=0] [L104] COND TRUE ! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4)))) [L105] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [L108] COND FALSE !(var_1_12 < var_1_12) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=128, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [L111] COND TRUE \read(var_1_28) [L112] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [L117] unsigned char stepLocal_10 = var_1_9; [L118] signed short int stepLocal_9 = var_1_10; [L119] unsigned char stepLocal_8 = var_1_15; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=256, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [L120] COND TRUE \read(var_1_28) [L121] var_1_27 = var_1_5 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [L135] unsigned char stepLocal_1 = var_1_4 > 2; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=1000000, var_1_7=0, var_1_8=0, var_1_9=0] [L136] COND TRUE \read(var_1_28) [L137] var_1_6 = (var_1_4 + var_1_27) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L143] signed short int stepLocal_7 = var_1_27; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L144] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L151] signed short int stepLocal_6 = var_1_10; VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_6=127, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=5/4, var_1_1=256, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L152] COND FALSE !(\read(var_1_8)) [L159] var_1_17 = var_1_21 VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, stepLocal_10=0, stepLocal_1=1, stepLocal_6=127, stepLocal_7=0, stepLocal_8=1, stepLocal_9=127, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L224] RET step() [L225] CALL, EXPR property() [L215-L216] return ((((((((((((! var_1_28) && var_1_28) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_28 ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) 1)))) && (var_1_28 ? (var_1_6 == ((unsigned long int) (var_1_4 + var_1_27))) : (((var_1_4 > 2) && var_1_8) ? (var_1_6 == ((unsigned long int) ((((var_1_27) > (var_1_4)) ? (var_1_27) : (var_1_4))))) : 1))) && (var_1_7 == ((signed short int) var_1_5))) && ((var_1_12 == ((((var_1_7) > (var_1_12)) ? (var_1_7) : (var_1_12)))) ? ((! (var_1_12 > ((((var_1_7) < (var_1_4)) ? (var_1_7) : (var_1_4))))) ? (var_1_8 == ((unsigned char) var_1_9)) : 1) : 1)) && ((var_1_12 < var_1_12) ? (var_1_10 == ((signed short int) (var_1_25 - ((((var_1_5) < (16)) ? (var_1_5) : (16)))))) : (var_1_28 ? (var_1_10 == ((signed short int) var_1_4)) : (var_1_10 == ((signed short int) var_1_25))))) && ((last_1_var_1_7 > last_1_var_1_6) ? ((last_1_var_1_7 < last_1_var_1_25) ? ((last_1_var_1_1 <= last_1_var_1_12) ? (var_1_12 == ((unsigned char) (((((var_1_4) < (var_1_14)) ? (var_1_4) : (var_1_14))) - var_1_5))) : (var_1_12 == ((unsigned char) (((((var_1_5) < (var_1_15)) ? (var_1_5) : (var_1_15))) + var_1_16)))) : (var_1_12 == ((unsigned char) var_1_16))) : 1)) && (var_1_8 ? ((var_1_10 <= var_1_23) ? (var_1_17 == ((float) ((((((1.0000000000000012E14f + var_1_18)) < (var_1_19)) ? ((1.0000000000000012E14f + var_1_18)) : (var_1_19))) + var_1_20))) : (var_1_17 == ((float) (var_1_21 - var_1_22)))) : (var_1_17 == ((float) var_1_21)))) && (var_1_8 ? ((var_1_27 <= last_1_var_1_23) ? (var_1_23 == ((unsigned char) 10)) : (var_1_23 == ((unsigned char) ((200 - var_1_24) - 64)))) : 1)) && ((var_1_21 != var_1_19) ? (var_1_28 ? (var_1_25 == ((unsigned char) ((((var_1_24) < (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))))) ? (var_1_24) : (((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16)))))))) : (var_1_25 == ((unsigned char) ((((4) > (var_1_5)) ? (4) : (var_1_5)))))) : (var_1_25 == ((unsigned char) (var_1_14 - (var_1_26 - var_1_24)))))) && (var_1_28 ? (var_1_27 == ((signed short int) var_1_5)) : (var_1_28 ? ((var_1_10 <= var_1_15) ? (var_1_27 == ((signed short int) -10)) : 1) : ((var_1_10 <= (var_1_4 - var_1_5)) ? ((var_1_9 || (var_1_19 < var_1_20)) ? (var_1_27 == ((signed short int) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + ((((var_1_14) > (var_1_10)) ? (var_1_14) : (var_1_10)))))) : 1) : 1)))) && ((last_1_var_1_25 < last_1_var_1_1) ? (((- last_1_var_1_17) < ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? (var_1_28 == ((unsigned char) ((last_1_var_1_28 || var_1_9) && var_1_30))) : (var_1_28 == ((unsigned char) var_1_30))) : (var_1_28 == ((unsigned char) var_1_31))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L225] RET, EXPR property() [L225] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, last_1_var_1_17=5/4, last_1_var_1_1=8, last_1_var_1_23=4, last_1_var_1_25=8, last_1_var_1_28=1, last_1_var_1_6=1000000, last_1_var_1_7=-1, var_1_10=127, var_1_12=0, var_1_14=49279, var_1_15=1, var_1_16=0, var_1_17=1000005, var_1_1=256, var_1_21=1000005, var_1_23=4, var_1_24=0, var_1_25=64, var_1_26=-193, var_1_27=0, var_1_28=-255, var_1_30=0, var_1_31=-255, var_1_4=127, var_1_5=256, var_1_6=127, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.7s, OverallIterations: 7, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 387 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 2025 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1228 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 217 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 797 mSDtfsCounter, 217 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 207 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1339 NumberOfCodeBlocks, 1339 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 2939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 412 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 8352/8400 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-04 00:02:44,437 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_operatoramount_amount100_file-99.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 8407555b2f77085f3aee4d6c3624a1f27ddb5ca7ca65bbc521a0be32e1f17ee0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:02:46,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:02:46,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:02:46,574 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:02:46,574 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:02:46,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:02:46,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:02:46,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:02:46,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:02:46,618 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:02:46,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:02:46,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:02:46,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:02:46,624 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:02:46,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:02:46,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:46,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:02:46,625 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:02:46,625 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 -> 8407555b2f77085f3aee4d6c3624a1f27ddb5ca7ca65bbc521a0be32e1f17ee0 [2025-03-04 00:02:46,876 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:02:46,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:02:46,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:02:46,896 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:02:46,896 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:02:46,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i [2025-03-04 00:02:48,173 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3731856/c35c5fd535e9460588c400d04cf760d0/FLAG760a2dabe [2025-03-04 00:02:48,411 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:02:48,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i [2025-03-04 00:02:48,420 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3731856/c35c5fd535e9460588c400d04cf760d0/FLAG760a2dabe [2025-03-04 00:02:48,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af3731856/c35c5fd535e9460588c400d04cf760d0 [2025-03-04 00:02:48,740 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:02:48,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:02:48,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:48,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:02:48,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:02:48,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:48" (1/1) ... [2025-03-04 00:02:48,757 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a15737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:48, skipping insertion in model container [2025-03-04 00:02:48,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:02:48" (1/1) ... [2025-03-04 00:02:48,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:02:48,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i[916,929] [2025-03-04 00:02:48,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:48,960 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:02:48,968 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-99.i[916,929] [2025-03-04 00:02:48,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:02:49,007 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:02:49,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49 WrapperNode [2025-03-04 00:02:49,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:02:49,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:49,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:02:49,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:02:49,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,048 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-03-04 00:02:49,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:02:49,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:02:49,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:02:49,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:02:49,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,061 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,070 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-04 00:02:49,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,087 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:02:49,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:02:49,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:02:49,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:02:49,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (1/1) ... [2025-03-04 00:02:49,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:02:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:02:49,122 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-04 00:02:49,127 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-04 00:02:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:02:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:02:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:02:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:02:49,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:02:49,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:02:49,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:02:49,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:02:50,029 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2025-03-04 00:02:50,030 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:02:50,039 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:02:50,039 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:02:50,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:50 BoogieIcfgContainer [2025-03-04 00:02:50,040 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:02:50,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:02:50,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:02:50,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:02:50,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:02:48" (1/3) ... [2025-03-04 00:02:50,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cbe144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:50, skipping insertion in model container [2025-03-04 00:02:50,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:02:49" (2/3) ... [2025-03-04 00:02:50,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28cbe144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:02:50, skipping insertion in model container [2025-03-04 00:02:50,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:02:50" (3/3) ... [2025-03-04 00:02:50,048 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-99.i [2025-03-04 00:02:50,060 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:02:50,062 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-99.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:02:50,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:02:50,111 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;@7babc306, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:02:50,111 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:02:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 00:02:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-04 00:02:50,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:50,124 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:50,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:50,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:50,128 INFO L85 PathProgramCache]: Analyzing trace with hash -2131778620, now seen corresponding path program 1 times [2025-03-04 00:02:50,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:50,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778380840] [2025-03-04 00:02:50,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:50,138 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-04 00:02:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:50,142 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-04 00:02:50,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 (2)] Waiting until timeout for monitored process [2025-03-04 00:02:50,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 00:02:50,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 00:02:50,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:50,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:50,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:02:50,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:50,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2025-03-04 00:02:50,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:50,494 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:50,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778380840] [2025-03-04 00:02:50,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778380840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:50,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:50,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:02:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109711280] [2025-03-04 00:02:50,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:50,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:02:50,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:50,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:02:50,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:02:50,517 INFO L87 Difference]: Start difference. First operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 00:02:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:50,538 INFO L93 Difference]: Finished difference Result 170 states and 296 transitions. [2025-03-04 00:02:50,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:02:50,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2025-03-04 00:02:50,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:50,545 INFO L225 Difference]: With dead ends: 170 [2025-03-04 00:02:50,545 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 00:02:50,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 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-04 00:02:50,550 INFO L435 NwaCegarLoop]: 132 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, 132 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-04 00:02:50,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:02:50,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 00:02:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 00:02:50,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 58 states have internal predecessors, (82), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-04 00:02:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 132 transitions. [2025-03-04 00:02:50,594 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 132 transitions. Word has length 165 [2025-03-04 00:02:50,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:50,595 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 132 transitions. [2025-03-04 00:02:50,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 00:02:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 132 transitions. [2025-03-04 00:02:50,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 00:02:50,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:50,600 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:50,609 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-04 00:02:50,800 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-04 00:02:50,801 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2117002909, now seen corresponding path program 1 times [2025-03-04 00:02:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:50,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964383759] [2025-03-04 00:02:50,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:50,804 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-04 00:02:50,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:50,806 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-04 00:02:50,807 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-04 00:02:50,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-04 00:02:51,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 00:02:51,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:51,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:51,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:02:51,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:52,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:52,183 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:52,183 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:52,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1964383759] [2025-03-04 00:02:52,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1964383759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:52,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:52,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:02:52,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371691569] [2025-03-04 00:02:52,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:52,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:02:52,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:52,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:02:52,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:02:52,186 INFO L87 Difference]: Start difference. First operand 85 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:53,208 INFO L93 Difference]: Finished difference Result 250 states and 391 transitions. [2025-03-04 00:02:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:02:53,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2025-03-04 00:02:53,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:53,221 INFO L225 Difference]: With dead ends: 250 [2025-03-04 00:02:53,221 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 00:02:53,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:02:53,224 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 99 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:53,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 448 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 00:02:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 00:02:53,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2025-03-04 00:02:53,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:02:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 203 transitions. [2025-03-04 00:02:53,256 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 203 transitions. Word has length 166 [2025-03-04 00:02:53,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:53,256 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 203 transitions. [2025-03-04 00:02:53,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 203 transitions. [2025-03-04 00:02:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-04 00:02:53,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:53,259 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:53,269 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 (3)] Ended with exit code 0 [2025-03-04 00:02:53,459 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-04 00:02:53,460 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:53,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash -837586236, now seen corresponding path program 1 times [2025-03-04 00:02:53,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:53,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899610065] [2025-03-04 00:02:53,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:53,461 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-04 00:02:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:53,463 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-04 00:02:53,464 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-04 00:02:53,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 00:02:53,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 00:02:53,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:53,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:53,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:02:53,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:53,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:53,999 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:54,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899610065] [2025-03-04 00:02:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899610065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:54,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:54,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:02:54,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258686577] [2025-03-04 00:02:54,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:54,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:02:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:54,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:02:54,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:02:54,001 INFO L87 Difference]: Start difference. First operand 132 states and 203 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:54,779 INFO L93 Difference]: Finished difference Result 250 states and 390 transitions. [2025-03-04 00:02:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:02:54,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-04 00:02:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:54,796 INFO L225 Difference]: With dead ends: 250 [2025-03-04 00:02:54,797 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 00:02:54,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:02:54,798 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 97 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:54,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 503 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:02:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 00:02:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 133. [2025-03-04 00:02:54,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.3) internal successors, (104), 80 states have internal predecessors, (104), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:02:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 204 transitions. [2025-03-04 00:02:54,820 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 204 transitions. Word has length 167 [2025-03-04 00:02:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:54,820 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 204 transitions. [2025-03-04 00:02:54,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 204 transitions. [2025-03-04 00:02:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 00:02:54,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:54,834 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:54,844 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-04 00:02:55,035 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-04 00:02:55,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:55,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:55,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1855583673, now seen corresponding path program 1 times [2025-03-04 00:02:55,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:55,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333555916] [2025-03-04 00:02:55,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:55,038 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-04 00:02:55,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:55,041 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-04 00:02:55,042 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-04 00:02:55,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 00:02:55,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 00:02:55,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:55,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:55,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:02:55,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:55,838 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:55,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:55,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333555916] [2025-03-04 00:02:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333555916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:55,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:55,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:02:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587671211] [2025-03-04 00:02:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:55,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 00:02:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:55,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 00:02:55,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:02:55,841 INFO L87 Difference]: Start difference. First operand 133 states and 204 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:56,681 INFO L93 Difference]: Finished difference Result 250 states and 389 transitions. [2025-03-04 00:02:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:02:56,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-04 00:02:56,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:56,693 INFO L225 Difference]: With dead ends: 250 [2025-03-04 00:02:56,693 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 00:02:56,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:02:56,694 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 81 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:56,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 435 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 00:02:56,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 00:02:56,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 134. [2025-03-04 00:02:56,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:02:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 205 transitions. [2025-03-04 00:02:56,713 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 205 transitions. Word has length 168 [2025-03-04 00:02:56,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:56,713 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 205 transitions. [2025-03-04 00:02:56,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:56,713 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 205 transitions. [2025-03-04 00:02:56,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-04 00:02:56,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:56,718 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:56,727 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-04 00:02:56,918 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-04 00:02:56,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:56,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:56,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2066934586, now seen corresponding path program 1 times [2025-03-04 00:02:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:56,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786226818] [2025-03-04 00:02:56,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:56,920 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-04 00:02:56,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:56,927 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-04 00:02:56,933 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-04 00:02:56,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-04 00:02:57,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-04 00:02:57,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:57,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 00:02:57,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-03-04 00:02:57,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:57,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:57,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786226818] [2025-03-04 00:02:57,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786226818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:57,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:57,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:02:57,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904849929] [2025-03-04 00:02:57,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:57,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:02:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:57,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:02:57,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:02:57,271 INFO L87 Difference]: Start difference. First operand 134 states and 205 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 00:02:58,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:58,422 INFO L93 Difference]: Finished difference Result 319 states and 474 transitions. [2025-03-04 00:02:58,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 00:02:58,423 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) Word has length 168 [2025-03-04 00:02:58,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:58,425 INFO L225 Difference]: With dead ends: 319 [2025-03-04 00:02:58,425 INFO L226 Difference]: Without dead ends: 237 [2025-03-04 00:02:58,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:02:58,426 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 369 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:58,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 651 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:02:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-04 00:02:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 160. [2025-03-04 00:02:58,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 104 states have (on average 1.2596153846153846) internal successors, (131), 104 states have internal predecessors, (131), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-04 00:02:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2025-03-04 00:02:58,448 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 168 [2025-03-04 00:02:58,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:58,448 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2025-03-04 00:02:58,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 3 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-04 00:02:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2025-03-04 00:02:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-04 00:02:58,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:58,450 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:58,462 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-04 00:02:58,651 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-04 00:02:58,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:58,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1245930373, now seen corresponding path program 1 times [2025-03-04 00:02:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1524930231] [2025-03-04 00:02:58,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:58,652 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-04 00:02:58,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:58,653 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-04 00:02:58,654 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-04 00:02:58,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-04 00:02:58,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-04 00:02:58,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:58,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:58,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:02:58,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:02:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-04 00:02:59,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:02:59,058 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:02:59,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1524930231] [2025-03-04 00:02:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1524930231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:02:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:02:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:02:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616301525] [2025-03-04 00:02:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:02:59,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:02:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:02:59,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:02:59,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:02:59,059 INFO L87 Difference]: Start difference. First operand 160 states and 231 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:02:59,385 INFO L93 Difference]: Finished difference Result 368 states and 535 transitions. [2025-03-04 00:02:59,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:02:59,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 169 [2025-03-04 00:02:59,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:02:59,395 INFO L225 Difference]: With dead ends: 368 [2025-03-04 00:02:59,395 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 00:02:59,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:02:59,396 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 39 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:02:59,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 261 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:02:59,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 00:02:59,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2025-03-04 00:02:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 178 states have (on average 1.2921348314606742) internal successors, (230), 178 states have internal predecessors, (230), 75 states have call successors, (75), 8 states have call predecessors, (75), 8 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2025-03-04 00:02:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 380 transitions. [2025-03-04 00:02:59,414 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 380 transitions. Word has length 169 [2025-03-04 00:02:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:02:59,414 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 380 transitions. [2025-03-04 00:02:59,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-04 00:02:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 380 transitions. [2025-03-04 00:02:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 00:02:59,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:02:59,415 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:02:59,425 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-04 00:02:59,616 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-04 00:02:59,616 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:02:59,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:02:59,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1652385862, now seen corresponding path program 1 times [2025-03-04 00:02:59,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:02:59,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411139214] [2025-03-04 00:02:59,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:02:59,617 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-04 00:02:59,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:02:59,619 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-04 00:02:59,621 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-04 00:02:59,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 00:02:59,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 00:02:59,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:02:59,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:02:59,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 00:02:59,838 INFO L279 TraceCheckSpWp]: Computing forward predicates...