./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-46.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 bab9645b581a637242c5fc66eb904f27425b036bd791f46cff85375619d13d20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:14:04,602 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:14:04,653 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:14:04,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:14:04,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:14:04,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:14:04,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:14:04,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:14:04,678 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:14:04,678 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:14:04,678 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:14:04,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:14:04,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:14:04,679 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:14:04,680 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:14:04,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:14:04,681 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:14:04,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:14:04,681 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 -> bab9645b581a637242c5fc66eb904f27425b036bd791f46cff85375619d13d20 [2025-03-03 19:14:04,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:14:04,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:14:04,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:14:04,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:14:04,899 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:14:04,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-46.i [2025-03-03 19:14:06,019 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87b1565d/59568226b19a41d183573a4e0186374e/FLAG77935f96c [2025-03-03 19:14:06,251 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:14:06,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-46.i [2025-03-03 19:14:06,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87b1565d/59568226b19a41d183573a4e0186374e/FLAG77935f96c [2025-03-03 19:14:06,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87b1565d/59568226b19a41d183573a4e0186374e [2025-03-03 19:14:06,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:14:06,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:14:06,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:14:06,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:14:06,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:14:06,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f322d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06, skipping insertion in model container [2025-03-03 19:14:06,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:14:06,688 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_normal_file-46.i[913,926] [2025-03-03 19:14:06,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:14:06,758 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:14:06,766 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_normal_file-46.i[913,926] [2025-03-03 19:14:06,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:14:06,810 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:14:06,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06 WrapperNode [2025-03-03 19:14:06,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:14:06,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:14:06,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:14:06,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:14:06,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,872 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-03-03 19:14:06,872 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:14:06,873 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:14:06,873 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:14:06,873 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:14:06,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,882 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,908 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-03 19:14:06,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,920 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,931 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:14:06,936 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:14:06,936 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:14:06,936 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:14:06,937 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (1/1) ... [2025-03-03 19:14:06,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:14:06,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:14:06,961 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-03 19:14:06,966 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-03 19:14:06,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:14:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:14:06,981 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:14:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:14:06,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:14:06,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:14:07,038 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:14:07,039 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:14:07,309 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise16#1;havoc property_#t~bitwise17#1;havoc property_#t~short18#1; [2025-03-03 19:14:07,334 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 19:14:07,334 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:14:07,348 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:14:07,349 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:14:07,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:14:07 BoogieIcfgContainer [2025-03-03 19:14:07,349 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:14:07,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:14:07,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:14:07,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:14:07,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:14:06" (1/3) ... [2025-03-03 19:14:07,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7187aacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:14:07, skipping insertion in model container [2025-03-03 19:14:07,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:06" (2/3) ... [2025-03-03 19:14:07,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7187aacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:14:07, skipping insertion in model container [2025-03-03 19:14:07,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:14:07" (3/3) ... [2025-03-03 19:14:07,357 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-46.i [2025-03-03 19:14:07,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:14:07,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-46.i that has 2 procedures, 71 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:14:07,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:14:07,429 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;@622d668a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:14:07,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:14:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:14:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 19:14:07,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:14:07,445 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:14:07,445 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:14:07,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:14:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1848203273, now seen corresponding path program 1 times [2025-03-03 19:14:07,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:14:07,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855409575] [2025-03-03 19:14:07,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:14:07,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:14:07,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 19:14:07,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 19:14:07,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:14:07,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:14:07,689 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 19:14:07,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:14:07,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855409575] [2025-03-03 19:14:07,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855409575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:14:07,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106862872] [2025-03-03 19:14:07,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:14:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:14:07,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:14:07,693 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-03 19:14:07,695 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-03 19:14:07,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 19:14:07,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 19:14:07,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:14:07,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:14:07,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:14:07,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:14:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-03-03 19:14:07,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:14:07,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106862872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:14:07,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:14:07,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:14:07,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178949700] [2025-03-03 19:14:07,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:14:07,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:14:07,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:14:07,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:14:07,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:14:07,883 INFO L87 Difference]: Start difference. First operand has 71 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:14:07,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:14:07,905 INFO L93 Difference]: Finished difference Result 136 states and 228 transitions. [2025-03-03 19:14:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:14:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-03-03 19:14:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:14:07,913 INFO L225 Difference]: With dead ends: 136 [2025-03-03 19:14:07,913 INFO L226 Difference]: Without dead ends: 68 [2025-03-03 19:14:07,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-03 19:14:07,918 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:14:07,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:14:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-03 19:14:07,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-03 19:14:07,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:14:07,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2025-03-03 19:14:07,952 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 125 [2025-03-03 19:14:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:14:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2025-03-03 19:14:07,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:14:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2025-03-03 19:14:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 19:14:07,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:14:07,957 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:14:07,963 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-03 19:14:08,162 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-03 19:14:08,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:14:08,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:14:08,163 INFO L85 PathProgramCache]: Analyzing trace with hash 593815097, now seen corresponding path program 1 times [2025-03-03 19:14:08,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:14:08,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678254954] [2025-03-03 19:14:08,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:14:08,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:14:08,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 19:14:08,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 19:14:08,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:14:08,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:14:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-03-03 19:14:19,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:14:19,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678254954] [2025-03-03 19:14:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678254954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:14:19,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:14:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 19:14:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516940492] [2025-03-03 19:14:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:14:19,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:14:19,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:14:19,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:14:19,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:14:19,708 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:14:20,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:14:20,555 INFO L93 Difference]: Finished difference Result 232 states and 338 transitions. [2025-03-03 19:14:20,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 19:14:20,555 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 126 [2025-03-03 19:14:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:14:20,557 INFO L225 Difference]: With dead ends: 232 [2025-03-03 19:14:20,557 INFO L226 Difference]: Without dead ends: 167 [2025-03-03 19:14:20,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-03 19:14:20,558 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 201 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 19:14:20,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 403 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 19:14:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-03 19:14:20,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 127. [2025-03-03 19:14:20,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 97 states have internal predecessors, (134), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-03 19:14:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 188 transitions. [2025-03-03 19:14:20,581 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 188 transitions. Word has length 126 [2025-03-03 19:14:20,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:14:20,582 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 188 transitions. [2025-03-03 19:14:20,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-03-03 19:14:20,582 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 188 transitions. [2025-03-03 19:14:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 19:14:20,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:14:20,585 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:14:20,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:14:20,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:14:20,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:14:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2101366906, now seen corresponding path program 1 times [2025-03-03 19:14:20,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:14:20,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988293528] [2025-03-03 19:14:20,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:14:20,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:14:20,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 19:14:20,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 19:14:20,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:14:20,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:14:20,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [769722214] [2025-03-03 19:14:20,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:14:20,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:14:20,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:14:20,664 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-03 19:14:20,666 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-03 19:14:20,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 19:14:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 19:14:20,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:14:20,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:14:20,746 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:14:20,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 19:14:20,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 19:14:20,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:14:20,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:14:20,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:14:20,829 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:14:20,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:14:20,837 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-03 19:14:21,031 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-03 19:14:21,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-03 19:14:21,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:14:21,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:14:21 BoogieIcfgContainer [2025-03-03 19:14:21,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:14:21,110 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:14:21,111 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:14:21,111 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:14:21,112 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:14:07" (3/4) ... [2025-03-03 19:14:21,113 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:14:21,114 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:14:21,114 INFO L158 Benchmark]: Toolchain (without parser) took 14538.87ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 122.0MB in the beginning and 284.5MB in the end (delta: -162.5MB). Peak memory consumption was 264.5MB. Max. memory is 16.1GB. [2025-03-03 19:14:21,114 INFO L158 Benchmark]: CDTParser took 0.90ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:14:21,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.40ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 107.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:14:21,115 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.18ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 103.1MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:14:21,115 INFO L158 Benchmark]: Boogie Preprocessor took 62.39ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 97.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:14:21,115 INFO L158 Benchmark]: IcfgBuilder took 413.36ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 69.0MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:14:21,115 INFO L158 Benchmark]: TraceAbstraction took 13758.96ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 68.3MB in the beginning and 284.7MB in the end (delta: -216.3MB). Peak memory consumption was 214.2MB. Max. memory is 16.1GB. [2025-03-03 19:14:21,115 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 595.6MB. Free memory was 284.7MB in the beginning and 284.5MB in the end (delta: 123.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:14:21,116 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.90ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.40ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 107.5MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.18ms. Allocated memory is still 167.8MB. Free memory was 107.5MB in the beginning and 103.1MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.39ms. Allocated memory is still 167.8MB. Free memory was 103.1MB in the beginning and 97.2MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 413.36ms. Allocated memory is still 167.8MB. Free memory was 97.2MB in the beginning and 69.0MB in the end (delta: 28.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13758.96ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 68.3MB in the beginning and 284.7MB in the end (delta: -216.3MB). Peak memory consumption was 214.2MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 595.6MB. Free memory was 284.7MB in the beginning and 284.5MB in the end (delta: 123.2kB). 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 109, overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 125, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_11 = 63.75; [L32] signed long int var_1_12 = 100000; [L33] unsigned short int var_1_13 = 8; [L34] signed long int var_1_14 = 2; [L35] signed long int var_1_15 = 32; [L36] double var_1_17 = 127.5; [L37] double var_1_18 = 32.75; [L38] signed char var_1_19 = 0; [L39] unsigned long int var_1_20 = 128; [L40] unsigned short int last_1_var_1_13 = 8; [L41] double last_1_var_1_17 = 127.5; VAL [isInitial=0, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] CALL updateLastVariables() [L121] last_1_var_1_13 = var_1_13 [L122] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L93] var_1_3 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L103] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L106] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L107] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L108] var_1_11 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L109] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L110] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L110] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L111] var_1_14 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L112] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L113] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L113] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L114] var_1_15 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L115] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L116] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L117] var_1_18 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L118] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L133] RET updateVariables() [L134] CALL step() [L45] COND FALSE !(-100000 >= last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L48] COND FALSE !((last_1_var_1_17 / var_1_11) == 999999.6f) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L52] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, stepLocal_0=-255, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L53] COND TRUE var_1_2 && stepLocal_0 [L54] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=10, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L58] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L65] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L67] var_1_17 = var_1_18 [L68] var_1_19 = 5 [L69] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L70] COND FALSE !(var_1_1 < var_1_20) [L77] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L79] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L79] EXPR var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L79] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) [L86] var_1_13 = var_1_1 VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=127, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1))) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=127, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L125-L126] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= last_1_var_1_13) ? (var_1_9 == ((unsigned short int) (((((last_1_var_1_13 + var_1_5)) > (64)) ? ((last_1_var_1_13 + var_1_5)) : (64))))) : (((last_1_var_1_17 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_1 < var_1_20) ? ((var_1_5 == (~ (var_1_1 + var_1_20))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_1)) ? (-1) : (var_1_1))))) ? (var_1_5) : (((((-1) < (var_1_1)) ? (-1) : (var_1_1)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_20) < (var_1_8)) ? (var_1_20) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_6)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_9)) ? (var_1_8) : (var_1_9))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_6)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_1)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=127, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=8, last_1_var_1_17=255/2, var_1_12=0, var_1_13=127, var_1_14=1, var_1_15=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=-255, var_1_3=-255, var_1_4=127, var_1_5=256, var_1_6=0, var_1_7=32767, var_1_8=-32769, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 201 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 201 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 190 IncrementalHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 211 mSDtfsCounter, 190 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 40 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 628 NumberOfCodeBlocks, 628 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 373 ConstructedInterpolants, 0 QuantifiedInterpolants, 1636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 298 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2016/2052 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-03 19:14:21,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-46.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 bab9645b581a637242c5fc66eb904f27425b036bd791f46cff85375619d13d20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:14:22,918 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:14:22,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:14:23,004 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:14:23,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:14:23,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:14:23,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:14:23,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:14:23,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:14:23,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:14:23,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:14:23,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:14:23,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:14:23,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:14:23,030 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:14:23,030 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:14:23,030 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:14:23,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:14:23,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:14:23,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:14:23,031 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:14:23,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:14:23,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:14:23,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:14:23,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:14:23,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:14:23,032 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:14:23,032 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:14:23,032 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:14:23,032 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:14:23,033 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:14:23,033 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:14:23,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:14:23,033 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:14:23,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:14:23,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:14:23,033 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 -> bab9645b581a637242c5fc66eb904f27425b036bd791f46cff85375619d13d20 [2025-03-03 19:14:23,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:14:23,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:14:23,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:14:23,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:14:23,274 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:14:23,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-46.i [2025-03-03 19:14:24,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af6e70e6/4c5bf2fc09b4495bada057e546297adb/FLAG54783b581 [2025-03-03 19:14:24,659 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:14:24,660 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-46.i [2025-03-03 19:14:24,667 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af6e70e6/4c5bf2fc09b4495bada057e546297adb/FLAG54783b581 [2025-03-03 19:14:25,012 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af6e70e6/4c5bf2fc09b4495bada057e546297adb [2025-03-03 19:14:25,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:14:25,015 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:14:25,016 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:14:25,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:14:25,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:14:25,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d60655c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25, skipping insertion in model container [2025-03-03 19:14:25,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:14:25,115 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_normal_file-46.i[913,926] [2025-03-03 19:14:25,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:14:25,181 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:14:25,190 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_normal_file-46.i[913,926] [2025-03-03 19:14:25,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:14:25,224 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:14:25,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25 WrapperNode [2025-03-03 19:14:25,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:14:25,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:14:25,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:14:25,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:14:25,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,256 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-03 19:14:25,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:14:25,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:14:25,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:14:25,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:14:25,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,265 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,273 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-03 19:14:25,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,287 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,290 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:14:25,290 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:14:25,290 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:14:25,290 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:14:25,291 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (1/1) ... [2025-03-03 19:14:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:14:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:14:25,317 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-03 19:14:25,320 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-03 19:14:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:14:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:14:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:14:25,333 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:14:25,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:14:25,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:14:25,391 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:14:25,392 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:14:38,288 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 19:14:38,288 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:14:38,295 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:14:38,296 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:14:38,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:14:38 BoogieIcfgContainer [2025-03-03 19:14:38,296 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:14:38,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:14:38,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:14:38,301 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:14:38,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:14:25" (1/3) ... [2025-03-03 19:14:38,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5855ece2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:14:38, skipping insertion in model container [2025-03-03 19:14:38,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:14:25" (2/3) ... [2025-03-03 19:14:38,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5855ece2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:14:38, skipping insertion in model container [2025-03-03 19:14:38,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:14:38" (3/3) ... [2025-03-03 19:14:38,303 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-46.i [2025-03-03 19:14:38,322 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:14:38,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-46.i that has 2 procedures, 58 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:14:38,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:14:38,368 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;@6cea89a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:14:38,368 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:14:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:14:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 19:14:38,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:14:38,380 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:14:38,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:14:38,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:14:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1157215843, now seen corresponding path program 1 times [2025-03-03 19:14:38,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:14:38,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245881441] [2025-03-03 19:14:38,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:14:38,392 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-03 19:14:38,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:14:38,394 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-03 19:14:38,395 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-03 19:14:38,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 19:14:39,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 19:14:39,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:14:39,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:14:39,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:14:39,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:14:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-03-03 19:14:39,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:14:39,097 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:14:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245881441] [2025-03-03 19:14:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245881441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:14:39,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:14:39,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:14:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844443159] [2025-03-03 19:14:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:14:39,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:14:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:14:39,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:14:39,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:14:39,114 INFO L87 Difference]: Start difference. First operand has 58 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:14:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:14:39,128 INFO L93 Difference]: Finished difference Result 109 states and 186 transitions. [2025-03-03 19:14:39,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:14:39,130 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 121 [2025-03-03 19:14:39,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:14:39,133 INFO L225 Difference]: With dead ends: 109 [2025-03-03 19:14:39,134 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 19:14:39,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 120 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-03 19:14:39,137 INFO L435 NwaCegarLoop]: 78 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, 78 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-03 19:14:39,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:14:39,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 19:14:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-03 19:14:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-03 19:14:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-03-03 19:14:39,163 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 121 [2025-03-03 19:14:39,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:14:39,163 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-03-03 19:14:39,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 19:14:39,164 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-03-03 19:14:39,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 19:14:39,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:14:39,167 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:14:39,182 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-03 19:14:39,367 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-03 19:14:39,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:14:39,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:14:39,369 INFO L85 PathProgramCache]: Analyzing trace with hash -838739042, now seen corresponding path program 1 times [2025-03-03 19:14:39,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:14:39,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281585071] [2025-03-03 19:14:39,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:14:39,369 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-03 19:14:39,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:14:39,371 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-03 19:14:39,372 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-03 19:14:39,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.