./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.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 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:10:19,448 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:10:19,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 11:10:19,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:10:19,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:10:19,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:10:19,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:10:19,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:10:19,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:10:19,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:10:19,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:10:19,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:10:19,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:10:19,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:10:19,537 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:10:19,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:10:19,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:10:19,537 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:10:19,538 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:10:19,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:10:19,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:10:19,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:10:19,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:10:19,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:10:19,539 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:10:19,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:10:19,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 11:10:19,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 11:10:19,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:10:19,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:10:19,540 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:10:19,540 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:10:19,540 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 -> 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 [2025-03-08 11:10:19,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:10:19,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:10:19,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:10:19,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:10:19,785 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:10:19,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2025-03-08 11:10:20,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c5bc63/6199cb6ac8aa4eceac5a786f288882e2/FLAGa52c3990e [2025-03-08 11:10:21,188 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:10:21,189 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2025-03-08 11:10:21,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c5bc63/6199cb6ac8aa4eceac5a786f288882e2/FLAGa52c3990e [2025-03-08 11:10:21,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/141c5bc63/6199cb6ac8aa4eceac5a786f288882e2 [2025-03-08 11:10:21,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:10:21,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:10:21,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:10:21,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:10:21,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:10:21,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d97036a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21, skipping insertion in model container [2025-03-08 11:10:21,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:10:21,632 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2025-03-08 11:10:21,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:10:21,700 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:10:21,707 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2025-03-08 11:10:21,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:10:21,754 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:10:21,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21 WrapperNode [2025-03-08 11:10:21,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:10:21,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:10:21,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:10:21,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:10:21,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,798 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2025-03-08 11:10:21,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:10:21,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:10:21,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:10:21,799 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:10:21,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,817 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-08 11:10:21,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:10:21,835 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:10:21,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:10:21,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:10:21,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (1/1) ... [2025-03-08 11:10:21,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:10:21,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:10:21,862 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-08 11:10:21,865 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-08 11:10:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:10:21,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:10:21,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:10:21,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 11:10:21,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:10:21,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:10:21,948 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:10:21,949 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:10:22,214 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 11:10:22,214 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:10:22,233 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:10:22,235 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:10:22,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:10:22 BoogieIcfgContainer [2025-03-08 11:10:22,235 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:10:22,237 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:10:22,237 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:10:22,241 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:10:22,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:10:21" (1/3) ... [2025-03-08 11:10:22,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40798467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:10:22, skipping insertion in model container [2025-03-08 11:10:22,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:21" (2/3) ... [2025-03-08 11:10:22,242 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40798467 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:10:22, skipping insertion in model container [2025-03-08 11:10:22,242 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:10:22" (3/3) ... [2025-03-08 11:10:22,243 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2025-03-08 11:10:22,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:10:22,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:10:22,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:10:22,324 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;@664dbb42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:10:22,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:10:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 11:10:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 11:10:22,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:10:22,343 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:10:22,344 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:10:22,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:10:22,349 INFO L85 PathProgramCache]: Analyzing trace with hash -18536729, now seen corresponding path program 1 times [2025-03-08 11:10:22,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:10:22,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037585620] [2025-03-08 11:10:22,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:22,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:10:22,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 11:10:22,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 11:10:22,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:22,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:10:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 11:10:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:10:22,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037585620] [2025-03-08 11:10:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037585620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 11:10:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346446373] [2025-03-08 11:10:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:22,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:10:22,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:10:22,641 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-08 11:10:22,643 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-08 11:10:22,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 11:10:22,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 11:10:22,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:22,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:10:22,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:10:22,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:10:22,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2025-03-08 11:10:22,845 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:10:22,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346446373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:10:22,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 11:10:22,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 11:10:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504817370] [2025-03-08 11:10:22,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:10:22,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:10:22,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:10:22,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:10:22,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:10:22,872 INFO L87 Difference]: Start difference. First operand has 81 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 53 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 11:10:22,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:10:22,901 INFO L93 Difference]: Finished difference Result 156 states and 271 transitions. [2025-03-08 11:10:22,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:10:22,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-03-08 11:10:22,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:10:22,907 INFO L225 Difference]: With dead ends: 156 [2025-03-08 11:10:22,908 INFO L226 Difference]: Without dead ends: 78 [2025-03-08 11:10:22,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 169 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-08 11:10:22,915 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 11:10:22,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:10:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-08 11:10:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-08 11:10:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 11:10:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2025-03-08 11:10:22,949 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 168 [2025-03-08 11:10:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:10:22,949 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2025-03-08 11:10:22,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 11:10:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2025-03-08 11:10:22,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 11:10:22,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:10:22,951 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:10:22,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 11:10:23,152 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-08 11:10:23,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:10:23,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:10:23,153 INFO L85 PathProgramCache]: Analyzing trace with hash 87839209, now seen corresponding path program 1 times [2025-03-08 11:10:23,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:10:23,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966524114] [2025-03-08 11:10:23,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:23,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:10:23,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 11:10:23,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 11:10:23,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:23,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:10:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 11:10:23,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 11:10:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966524114] [2025-03-08 11:10:23,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966524114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:10:23,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:10:23,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 11:10:23,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479593614] [2025-03-08 11:10:23,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:10:23,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:10:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 11:10:23,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:10:23,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:10:23,566 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 11:10:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:10:23,747 INFO L93 Difference]: Finished difference Result 229 states and 355 transitions. [2025-03-08 11:10:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:10:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-08 11:10:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:10:23,751 INFO L225 Difference]: With dead ends: 229 [2025-03-08 11:10:23,751 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 11:10:23,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:10:23,752 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 94 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:10:23,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 340 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:10:23,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 11:10:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2025-03-08 11:10:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 11:10:23,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 214 transitions. [2025-03-08 11:10:23,789 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 214 transitions. Word has length 168 [2025-03-08 11:10:23,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:10:23,789 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 214 transitions. [2025-03-08 11:10:23,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 11:10:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 214 transitions. [2025-03-08 11:10:23,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 11:10:23,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:10:23,792 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:10:23,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 11:10:23,792 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:10:23,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:10:23,793 INFO L85 PathProgramCache]: Analyzing trace with hash -440421600, now seen corresponding path program 1 times [2025-03-08 11:10:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 11:10:23,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480007598] [2025-03-08 11:10:23,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:23,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 11:10:23,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 11:10:24,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 11:10:24,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:24,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 11:10:24,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2042122131] [2025-03-08 11:10:24,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:24,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 11:10:24,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:10:24,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 11:10:24,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 11:10:24,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 11:10:24,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 11:10:24,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:24,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:10:24,186 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 11:10:24,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 11:10:24,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 11:10:24,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:24,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 11:10:24,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 11:10:24,498 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 11:10:24,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 11:10:24,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 11:10:24,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 11:10:24,703 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 11:10:24,794 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 11:10:24,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:10:24 BoogieIcfgContainer [2025-03-08 11:10:24,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 11:10:24,797 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 11:10:24,797 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 11:10:24,797 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 11:10:24,798 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:10:22" (3/4) ... [2025-03-08 11:10:24,799 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 11:10:24,800 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 11:10:24,800 INFO L158 Benchmark]: Toolchain (without parser) took 3290.44ms. Allocated memory is still 167.8MB. Free memory was 129.2MB in the beginning and 43.2MB in the end (delta: 86.0MB). Peak memory consumption was 83.1MB. Max. memory is 16.1GB. [2025-03-08 11:10:24,801 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:10:24,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.48ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 114.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 11:10:24,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.02ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 111.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:10:24,803 INFO L158 Benchmark]: Boogie Preprocessor took 35.35ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 109.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:10:24,803 INFO L158 Benchmark]: IcfgBuilder took 400.36ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 85.7MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 11:10:24,803 INFO L158 Benchmark]: TraceAbstraction took 2559.44ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 43.2MB in the end (delta: 42.0MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2025-03-08 11:10:24,804 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 167.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 11:10:24,805 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.60ms. Allocated memory is still 201.3MB. Free memory is still 127.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.48ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 114.4MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.02ms. Allocated memory is still 167.8MB. Free memory was 114.4MB in the beginning and 111.7MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.35ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 109.0MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 400.36ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 85.7MB in the end (delta: 23.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2559.44ms. Allocated memory is still 167.8MB. Free memory was 85.2MB in the beginning and 43.2MB in the end (delta: 42.0MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 167.8MB. Free memory was 43.2MB in the beginning and 43.2MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 141, overapproximation of someBinaryFLOATComparisonOperation at line 147, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 56, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 134, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -4; [L23] signed short int var_1_4 = 256; [L24] signed short int var_1_5 = 0; [L25] signed short int var_1_6 = 25; [L26] signed short int var_1_8 = 100; [L27] unsigned char var_1_9 = 1; [L28] signed short int var_1_10 = -4; [L29] unsigned char var_1_11 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 1; [L32] unsigned long int var_1_14 = 64; [L33] double var_1_15 = 10.3; [L34] double var_1_16 = 128.6; [L35] unsigned long int var_1_17 = 2600113953; [L36] float var_1_18 = 8.25; [L37] float var_1_19 = 31.5; [L38] float var_1_20 = 2.625; [L39] float var_1_21 = 999999999999999.2; [L40] float var_1_22 = 127.5; [L41] float var_1_23 = 4.8; [L42] float var_1_24 = 16.5; [L43] signed long int var_1_25 = 10; [L44] unsigned char var_1_26 = 64; [L45] unsigned short int var_1_27 = 16; [L46] unsigned char var_1_28 = 1; [L47] unsigned char var_1_29 = 0; [L48] signed long int var_1_30 = 2; [L49] signed long int var_1_31 = 10; [L50] unsigned char last_1_var_1_9 = 1; VAL [isInitial=0, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L165] isInitial = 1 [L166] FCALL initially() [L167] COND TRUE 1 [L168] CALL updateLastVariables() [L158] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=256, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L168] RET updateLastVariables() [L169] CALL updateVariables() [L114] var_1_4 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L115] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L116] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=0, var_1_6=25, var_1_8=100, var_1_9=1] [L117] var_1_5 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=100, var_1_9=1] [L118] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=100, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=100, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=100, var_1_9=1] [L119] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=100, var_1_9=1] [L120] var_1_8 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L121] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L122] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=-4, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L123] var_1_10 = __VERIFIER_nondet_short() [L124] CALL assume_abort_if_not(var_1_10 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L124] RET assume_abort_if_not(var_1_10 >= -32768) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_10 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L125] RET assume_abort_if_not(var_1_10 <= 32767) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L126] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L127] var_1_11 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L128] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L129] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L130] var_1_12 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L131] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L132] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_15=103/10, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_double() [L134] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L134] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_16=643/5, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L135] var_1_16 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L136] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=2600113953, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L137] var_1_17 = __VERIFIER_nondet_ulong() [L138] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L138] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L139] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_19=63/2, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L140] var_1_19 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L141] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_20=21/8, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L142] var_1_20 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_20 >= 0.0F && 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_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L143] RET assume_abort_if_not((var_1_20 >= 0.0F && 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_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_21=4999999999999996/5, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L144] var_1_21 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L145] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_22=255/2, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L146] var_1_22 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L147] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_24=33/2, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L148] var_1_24 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L149] RET assume_abort_if_not((var_1_24 >= -922337.2036854765600e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=0, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L150] var_1_29 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L151] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L152] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=10, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L153] var_1_31 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_31 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L154] RET assume_abort_if_not(var_1_31 >= -2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L155] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=24/5, var_1_25=10, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L169] RET updateVariables() [L170] CALL step() [L54] var_1_23 = var_1_24 [L55] var_1_25 = 256 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=64, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L56] COND TRUE var_1_24 > ((((63.125f) > (var_1_23)) ? (63.125f) : (var_1_23))) [L57] var_1_26 = ((((1) < 0 ) ? -(1) : (1))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=16, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L59] var_1_27 = var_1_26 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L60] COND FALSE !(1 > var_1_27) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L65] COND FALSE !(var_1_23 < var_1_24) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L70] COND TRUE \read(var_1_29) [L71] var_1_30 = var_1_27 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L76] COND TRUE \read(last_1_var_1_9) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=25, var_1_8=40, var_1_9=1] [L77] COND TRUE var_1_5 == var_1_4 [L78] var_1_6 = ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=33/4, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=1] [L85] COND FALSE !(-32 >= (var_1_5 - var_1_8)) [L92] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=64, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=1] [L94] COND TRUE var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16)))) [L95] var_1_14 = (var_1_17 - (var_1_8 + var_1_4)) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=1] [L97] unsigned long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_9=1, stepLocal_0=-1670265068, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=1] [L98] COND TRUE ((var_1_8 % var_1_10) * (8 + var_1_14)) >= stepLocal_0 [L99] var_1_9 = ((! var_1_11) || var_1_12) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=-4, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=0] [L103] COND FALSE !(var_1_18 > var_1_18) [L106] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=9, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=0] [L108] unsigned long int stepLocal_1 = (((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)); VAL [isInitial=1, last_1_var_1_9=1, stepLocal_1=9, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=1, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=9, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=0] [L109] COND TRUE ((var_1_8 * var_1_1) + var_1_4) >= stepLocal_1 [L110] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=9, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=0] [L170] RET step() [L171] CALL, EXPR property() [L161-L162] return ((((((var_1_18 > var_1_18) ? (var_1_1 == ((signed short int) ((((((2 + var_1_4)) < (var_1_5)) ? ((2 + var_1_4)) : (var_1_5))) - 2))) : (var_1_1 == ((signed short int) var_1_4))) && (last_1_var_1_9 ? ((var_1_5 == var_1_4) ? (var_1_6 == ((signed short int) ((((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < ((var_1_4 - var_1_8))) ? (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) : ((var_1_4 - var_1_8)))))) : (var_1_6 == ((signed short int) var_1_8))) : (var_1_6 == ((signed short int) var_1_4)))) && ((((var_1_8 % var_1_10) * (8 + var_1_14)) >= var_1_14) ? (var_1_9 == ((unsigned char) ((! var_1_11) || var_1_12))) : (var_1_9 == ((unsigned char) (! var_1_12))))) && ((((var_1_8 * var_1_1) + var_1_4) >= ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))) ? (var_1_13 == ((unsigned char) var_1_12)) : 1)) && ((var_1_18 < ((((var_1_18) > ((var_1_15 - var_1_16))) ? (var_1_18) : ((var_1_15 - var_1_16))))) ? (var_1_14 == ((unsigned long int) (var_1_17 - (var_1_8 + var_1_4)))) : 1)) && ((-32 >= (var_1_5 - var_1_8)) ? ((var_1_10 > var_1_6) ? (var_1_18 == ((float) ((var_1_19 - var_1_20) + (var_1_21 + var_1_22)))) : (var_1_18 == ((float) var_1_20))) : (var_1_18 == ((float) var_1_19))) ; VAL [\result=0, isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=9, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=0] [L171] RET, EXPR property() [L171] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=9, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=1, var_1_10=21, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=-1670265068, var_1_17=-1670265019, var_1_18=3, var_1_19=3, var_1_1=9, var_1_23=2, var_1_24=2, var_1_25=256, var_1_26=1, var_1_27=1, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-2147483647, var_1_4=9, var_1_5=9, var_1_6=-31, var_1_8=40, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 151 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 94 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 459 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 224 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15 IncrementalHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 235 mSDtfsCounter, 15 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 501 ConstructedInterpolants, 0 QuantifiedInterpolants, 899 SizeOfPredicates, 0 NumberOfNonLiveVariables, 391 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 3850/3900 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-08 11:10:24,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.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 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 11:10:26,639 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 11:10:26,722 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 11:10:26,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 11:10:26,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 11:10:26,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 11:10:26,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 11:10:26,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 11:10:26,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 11:10:26,745 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 11:10:26,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 11:10:26,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 11:10:26,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 11:10:26,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 11:10:26,746 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 11:10:26,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 11:10:26,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 11:10:26,747 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 11:10:26,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 11:10:26,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 11:10:26,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 11:10:26,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 11:10:26,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 11:10:26,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 11:10:26,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:10:26,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 11:10:26,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 11:10:26,750 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 11:10:26,750 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 11:10:26,750 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 11:10:26,750 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 -> 83604eaba023e80a74c2adeaae77fd22a53b798f0a7ca2c7b67374de35192140 [2025-03-08 11:10:26,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 11:10:26,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 11:10:26,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 11:10:26,985 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 11:10:26,985 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 11:10:26,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2025-03-08 11:10:28,133 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bad60fdd/839a5e38e6884f8bb194f41ee69f09b5/FLAGfb3b20498 [2025-03-08 11:10:28,348 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 11:10:28,348 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2025-03-08 11:10:28,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bad60fdd/839a5e38e6884f8bb194f41ee69f09b5/FLAGfb3b20498 [2025-03-08 11:10:28,374 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bad60fdd/839a5e38e6884f8bb194f41ee69f09b5 [2025-03-08 11:10:28,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 11:10:28,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 11:10:28,380 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 11:10:28,380 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 11:10:28,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 11:10:28,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14bd088c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28, skipping insertion in model container [2025-03-08 11:10:28,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,403 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 11:10:28,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2025-03-08 11:10:28,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:10:28,576 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 11:10:28,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-54.i[915,928] [2025-03-08 11:10:28,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 11:10:28,617 INFO L204 MainTranslator]: Completed translation [2025-03-08 11:10:28,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28 WrapperNode [2025-03-08 11:10:28,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 11:10:28,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 11:10:28,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 11:10:28,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 11:10:28,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,632 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,657 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2025-03-08 11:10:28,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 11:10:28,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 11:10:28,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 11:10:28,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 11:10:28,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,686 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-08 11:10:28,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,700 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 11:10:28,706 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 11:10:28,706 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 11:10:28,706 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 11:10:28,707 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (1/1) ... [2025-03-08 11:10:28,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 11:10:28,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 11:10:28,738 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-08 11:10:28,740 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-08 11:10:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 11:10:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 11:10:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 11:10:28,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 11:10:28,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 11:10:28,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 11:10:28,824 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 11:10:28,826 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 11:10:32,785 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 11:10:32,788 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 11:10:32,795 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 11:10:32,796 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 11:10:32,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:10:32 BoogieIcfgContainer [2025-03-08 11:10:32,796 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 11:10:32,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 11:10:32,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 11:10:32,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 11:10:32,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:10:28" (1/3) ... [2025-03-08 11:10:32,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517209c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:10:32, skipping insertion in model container [2025-03-08 11:10:32,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:10:28" (2/3) ... [2025-03-08 11:10:32,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@517209c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:10:32, skipping insertion in model container [2025-03-08 11:10:32,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:10:32" (3/3) ... [2025-03-08 11:10:32,804 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i [2025-03-08 11:10:32,817 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 11:10:32,819 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-54.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 11:10:32,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 11:10:32,874 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;@55f4dd1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 11:10:32,874 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 11:10:32,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 11:10:32,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 11:10:32,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:10:32,890 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:10:32,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:10:32,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:10:32,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1020739002, now seen corresponding path program 1 times [2025-03-08 11:10:32,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:10:32,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681335921] [2025-03-08 11:10:32,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:32,902 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-08 11:10:32,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:10:32,904 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-08 11:10:32,906 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-08 11:10:32,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 11:10:33,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 11:10:33,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:33,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:10:33,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 11:10:33,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:10:33,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2025-03-08 11:10:33,337 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:10:33,338 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:10:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681335921] [2025-03-08 11:10:33,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681335921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:10:33,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:10:33,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 11:10:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043838859] [2025-03-08 11:10:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:10:33,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 11:10:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:10:33,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 11:10:33,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 11:10:33,363 INFO L87 Difference]: Start difference. First operand has 77 states, 48 states have (on average 1.375) internal successors, (66), 49 states have internal predecessors, (66), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 11:10:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:10:33,388 INFO L93 Difference]: Finished difference Result 148 states and 257 transitions. [2025-03-08 11:10:33,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 11:10:33,391 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 168 [2025-03-08 11:10:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:10:33,395 INFO L225 Difference]: With dead ends: 148 [2025-03-08 11:10:33,396 INFO L226 Difference]: Without dead ends: 74 [2025-03-08 11:10:33,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-08 11:10:33,400 INFO L435 NwaCegarLoop]: 112 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, 112 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-08 11:10:33,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 11:10:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-08 11:10:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-08 11:10:33,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-08 11:10:33,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2025-03-08 11:10:33,434 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 168 [2025-03-08 11:10:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:10:33,435 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2025-03-08 11:10:33,435 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2025-03-08 11:10:33,435 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2025-03-08 11:10:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 11:10:33,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:10:33,441 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:10:33,456 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-08 11:10:33,641 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-08 11:10:33,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:10:33,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:10:33,642 INFO L85 PathProgramCache]: Analyzing trace with hash -914363064, now seen corresponding path program 1 times [2025-03-08 11:10:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:10:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835077333] [2025-03-08 11:10:33,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:33,643 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-08 11:10:33,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:10:33,646 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-08 11:10:33,647 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-08 11:10:33,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 11:10:34,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 11:10:34,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:34,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:10:34,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 11:10:34,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:10:34,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 11:10:34,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:10:34,147 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:10:34,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835077333] [2025-03-08 11:10:34,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835077333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:10:34,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:10:34,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:10:34,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62517204] [2025-03-08 11:10:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:10:34,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 11:10:34,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:10:34,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 11:10:34,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 11:10:34,151 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 11:10:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:10:34,237 INFO L93 Difference]: Finished difference Result 184 states and 279 transitions. [2025-03-08 11:10:34,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 11:10:34,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-08 11:10:34,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:10:34,242 INFO L225 Difference]: With dead ends: 184 [2025-03-08 11:10:34,242 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 11:10:34,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 166 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-08 11:10:34,243 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 89 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:10:34,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 238 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 11:10:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 11:10:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2025-03-08 11:10:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 63 states have internal predecessors, (73), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-08 11:10:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2025-03-08 11:10:34,269 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 168 [2025-03-08 11:10:34,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:10:34,269 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2025-03-08 11:10:34,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 11:10:34,270 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2025-03-08 11:10:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-08 11:10:34,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:10:34,271 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:10:34,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-08 11:10:34,471 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-08 11:10:34,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:10:34,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:10:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash -653418006, now seen corresponding path program 1 times [2025-03-08 11:10:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:10:34,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200199780] [2025-03-08 11:10:34,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:34,474 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-08 11:10:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:10:34,476 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-08 11:10:34,478 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-08 11:10:34,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-08 11:10:34,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-08 11:10:34,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:10:34,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 11:10:34,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 11:10:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2025-03-08 11:10:35,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 11:10:35,918 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 11:10:35,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200199780] [2025-03-08 11:10:35,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200199780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 11:10:35,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 11:10:35,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 11:10:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292164960] [2025-03-08 11:10:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 11:10:35,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 11:10:35,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 11:10:35,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 11:10:35,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 11:10:35,921 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 11:10:39,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:10:42,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 11:10:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 11:10:42,074 INFO L93 Difference]: Finished difference Result 222 states and 325 transitions. [2025-03-08 11:10:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 11:10:42,104 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2025-03-08 11:10:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 11:10:42,105 INFO L225 Difference]: With dead ends: 222 [2025-03-08 11:10:42,105 INFO L226 Difference]: Without dead ends: 148 [2025-03-08 11:10:42,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 11:10:42,106 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 68 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2025-03-08 11:10:42,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 307 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2025-03-08 11:10:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-03-08 11:10:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2025-03-08 11:10:42,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-08 11:10:42,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 194 transitions. [2025-03-08 11:10:42,128 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 194 transitions. Word has length 168 [2025-03-08 11:10:42,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 11:10:42,128 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 194 transitions. [2025-03-08 11:10:42,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-08 11:10:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 194 transitions. [2025-03-08 11:10:42,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-08 11:10:42,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 11:10:42,134 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 11:10:42,146 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-08 11:10:42,334 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-08 11:10:42,334 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 11:10:42,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 11:10:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1944558785, now seen corresponding path program 1 times [2025-03-08 11:10:42,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 11:10:42,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226368999] [2025-03-08 11:10:42,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 11:10:42,335 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-08 11:10:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 11:10:42,337 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-08 11:10:42,338 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-08 11:10:42,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 11:10:42,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 11:10:42,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 11:10:42,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 11:10:42,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-08 11:10:42,734 INFO L279 TraceCheckSpWp]: Computing forward predicates...