./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.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 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:23:55,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:23:56,000 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:23:56,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:23:56,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:23:56,029 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:23:56,031 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:23:56,031 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:23:56,031 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:23:56,031 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:23:56,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:23:56,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:23:56,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:23:56,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:23:56,032 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:23:56,032 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:23:56,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:23:56,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:23:56,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:23:56,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:23:56,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:23:56,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:23:56,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:23:56,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:23:56,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:23:56,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:23:56,035 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:23:56,036 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 -> 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e [2025-03-04 00:23:56,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:23:56,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:23:56,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:23:56,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:23:56,272 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:23:56,273 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-04 00:23:57,411 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cba5977/f2ecff39829e418ea42d4b641e6f7c11/FLAG5ca6c03f0 [2025-03-04 00:23:57,655 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:23:57,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-04 00:23:57,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cba5977/f2ecff39829e418ea42d4b641e6f7c11/FLAG5ca6c03f0 [2025-03-04 00:23:57,970 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42cba5977/f2ecff39829e418ea42d4b641e6f7c11 [2025-03-04 00:23:57,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:23:57,972 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:23:57,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:23:57,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:23:57,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:23:57,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:23:57" (1/1) ... [2025-03-04 00:23:57,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66f5b902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:57, skipping insertion in model container [2025-03-04 00:23:57,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:23:57" (1/1) ... [2025-03-04 00:23:57,987 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:23:58,085 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2025-03-04 00:23:58,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:23:58,142 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:23:58,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2025-03-04 00:23:58,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:23:58,179 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:23:58,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58 WrapperNode [2025-03-04 00:23:58,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:23:58,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:23:58,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:23:58,181 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:23:58,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,212 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-03-04 00:23:58,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:23:58,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:23:58,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:23:58,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:23:58,220 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,226 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,234 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:23:58,234 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,234 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,238 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,240 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:23:58,241 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:23:58,241 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:23:58,241 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:23:58,242 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (1/1) ... [2025-03-04 00:23:58,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:23:58,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:23:58,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:23:58,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:23:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:23:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:23:58,289 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:23:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:23:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:23:58,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:23:58,349 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:23:58,350 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:23:58,511 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:23:58,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:23:58,518 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:23:58,519 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:23:58,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:23:58 BoogieIcfgContainer [2025-03-04 00:23:58,519 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:23:58,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:23:58,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:23:58,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:23:58,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:23:57" (1/3) ... [2025-03-04 00:23:58,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccfb47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:23:58, skipping insertion in model container [2025-03-04 00:23:58,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:23:58" (2/3) ... [2025-03-04 00:23:58,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccfb47a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:23:58, skipping insertion in model container [2025-03-04 00:23:58,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:23:58" (3/3) ... [2025-03-04 00:23:58,528 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-59.i [2025-03-04 00:23:58,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:23:58,541 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-59.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:23:58,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:23:58,589 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;@1c9b7f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:23:58,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:23:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:23:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 00:23:58,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:23:58,602 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:23:58,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:23:58,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:23:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash -331961269, now seen corresponding path program 1 times [2025-03-04 00:23:58,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:23:58,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685184677] [2025-03-04 00:23:58,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:23:58,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:23:58,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 00:23:58,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 00:23:58,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:23:58,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:23:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 00:23:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:23:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685184677] [2025-03-04 00:23:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685184677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:23:58,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019558348] [2025-03-04 00:23:58,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:23:58,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:23:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:23:58,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:23:58,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:23:58,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 00:23:58,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 00:23:58,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:23:58,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:23:58,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:23:58,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:23:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-04 00:23:59,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:23:59,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019558348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:23:59,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:23:59,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:23:59,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813126064] [2025-03-04 00:23:59,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:23:59,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:23:59,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:23:59,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:23:59,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:23:59,029 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:23:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:23:59,045 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2025-03-04 00:23:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:23:59,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-03-04 00:23:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:23:59,049 INFO L225 Difference]: With dead ends: 112 [2025-03-04 00:23:59,049 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:23:59,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:23:59,053 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:23:59,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:23:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:23:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 00:23:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:23:59,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2025-03-04 00:23:59,079 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 132 [2025-03-04 00:23:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:23:59,079 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2025-03-04 00:23:59,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:23:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2025-03-04 00:23:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 00:23:59,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:23:59,082 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:23:59,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:23:59,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:23:59,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:23:59,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:23:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash 502455556, now seen corresponding path program 1 times [2025-03-04 00:23:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:23:59,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020387025] [2025-03-04 00:23:59,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:23:59,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:23:59,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 00:23:59,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 00:23:59,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:23:59,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:23:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 00:23:59,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:23:59,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020387025] [2025-03-04 00:23:59,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020387025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:23:59,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:23:59,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:23:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677234887] [2025-03-04 00:23:59,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:23:59,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:23:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:23:59,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:23:59,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:23:59,604 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:23:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:23:59,621 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2025-03-04 00:23:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:23:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-03-04 00:23:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:23:59,623 INFO L225 Difference]: With dead ends: 109 [2025-03-04 00:23:59,623 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:23:59,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:23:59,624 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:23:59,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:23:59,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:23:59,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 00:23:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:23:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2025-03-04 00:23:59,630 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 132 [2025-03-04 00:23:59,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:23:59,631 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2025-03-04 00:23:59,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:23:59,631 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2025-03-04 00:23:59,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 00:23:59,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:23:59,632 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:23:59,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:23:59,632 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:23:59,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:23:59,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1574132735, now seen corresponding path program 1 times [2025-03-04 00:23:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:23:59,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312605568] [2025-03-04 00:23:59,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:23:59,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:23:59,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 00:23:59,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 00:23:59,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:23:59,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:23:59,734 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:23:59,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 00:23:59,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 00:23:59,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:23:59,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:23:59,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:23:59,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:23:59,853 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:23:59,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:23:59,857 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:23:59,943 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:23:59,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:23:59 BoogieIcfgContainer [2025-03-04 00:23:59,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:23:59,945 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:23:59,945 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:23:59,947 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:23:59,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:23:58" (3/4) ... [2025-03-04 00:23:59,949 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:23:59,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:23:59,950 INFO L158 Benchmark]: Toolchain (without parser) took 1977.45ms. Allocated memory is still 201.3MB. Free memory was 154.9MB in the beginning and 101.5MB in the end (delta: 53.4MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2025-03-04 00:23:59,950 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:23:59,951 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.23ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 141.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:23:59,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.16ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 140.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:23:59,952 INFO L158 Benchmark]: Boogie Preprocessor took 27.30ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 138.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:23:59,952 INFO L158 Benchmark]: IcfgBuilder took 278.14ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 121.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:23:59,952 INFO L158 Benchmark]: TraceAbstraction took 1423.89ms. Allocated memory is still 201.3MB. Free memory was 121.4MB in the beginning and 101.6MB in the end (delta: 19.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2025-03-04 00:23:59,953 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 201.3MB. Free memory was 101.6MB in the beginning and 101.5MB in the end (delta: 60.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:23:59,954 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.47ms. Allocated memory is still 201.3MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.23ms. Allocated memory is still 201.3MB. Free memory was 154.5MB in the beginning and 141.8MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.16ms. Allocated memory is still 201.3MB. Free memory was 141.8MB in the beginning and 140.1MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.30ms. Allocated memory is still 201.3MB. Free memory was 139.8MB in the beginning and 138.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 278.14ms. Allocated memory is still 201.3MB. Free memory was 138.2MB in the beginning and 121.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1423.89ms. Allocated memory is still 201.3MB. Free memory was 121.4MB in the beginning and 101.6MB in the end (delta: 19.9MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 201.3MB. Free memory was 101.6MB in the beginning and 101.5MB in the end (delta: 60.0kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 102, overapproximation of someBinaryFLOATComparisonOperation at line 100, overapproximation of someBinaryFLOATComparisonOperation at line 61, overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryFLOATComparisonOperation at line 104, overapproximation of someBinaryFLOATComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -128; [L23] signed long int var_1_4 = -32; [L24] signed long int var_1_5 = 10; [L25] signed long int var_1_6 = -1; [L26] unsigned long int var_1_7 = 25; [L27] unsigned char var_1_8 = 1; [L28] unsigned long int var_1_9 = 2; [L29] unsigned long int var_1_10 = 32; [L30] unsigned long int var_1_11 = 128; [L31] float var_1_12 = 24.2; [L32] double var_1_13 = 999999999999999.2; [L33] double var_1_14 = 9999999.6; [L34] double var_1_15 = 9.75; [L35] float var_1_16 = 999999999999999.4; [L36] float var_1_17 = 256.6; [L37] float var_1_18 = 8.875; [L38] float var_1_19 = 256.25; [L39] signed long int last_1_var_1_1 = -128; [L40] unsigned long int last_1_var_1_7 = 25; VAL [isInitial=0, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L115] isInitial = 1 [L116] FCALL initially() [L117] COND TRUE 1 [L118] CALL updateLastVariables() [L107] last_1_var_1_1 = var_1_1 [L108] last_1_var_1_7 = var_1_7 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-32, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L118] RET updateLastVariables() [L119] CALL updateVariables() [L70] var_1_4 = __VERIFIER_nondet_long() [L71] CALL assume_abort_if_not(var_1_4 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L71] RET assume_abort_if_not(var_1_4 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] CALL assume_abort_if_not(var_1_4 <= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L72] RET assume_abort_if_not(var_1_4 <= 536870912) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=10, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L73] var_1_5 = __VERIFIER_nondet_long() [L74] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L74] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] CALL assume_abort_if_not(var_1_5 <= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L75] RET assume_abort_if_not(var_1_5 <= 536870911) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=-1, var_1_7=25, var_1_8=1, var_1_9=2] [L76] var_1_6 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_6 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L77] RET assume_abort_if_not(var_1_6 >= -1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L78] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L78] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=1, var_1_9=2] [L79] var_1_8 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_9=2] [L80] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_9=2] [L81] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=2] [L81] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=2] [L82] var_1_9 = __VERIFIER_nondet_ulong() [L83] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0] [L83] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0] [L84] CALL assume_abort_if_not(var_1_9 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L84] RET assume_abort_if_not(var_1_9 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=32, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L85] var_1_10 = __VERIFIER_nondet_ulong() [L86] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L86] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L87] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L87] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=128, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L88] var_1_11 = __VERIFIER_nondet_ulong() [L89] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L89] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L90] CALL assume_abort_if_not(var_1_11 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L90] RET assume_abort_if_not(var_1_11 <= 4294967294) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_13=4999999999999996/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L91] var_1_13 = __VERIFIER_nondet_double() [L92] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L92] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_14=49999998/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L93] var_1_14 = __VERIFIER_nondet_double() [L94] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L94] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_15=39/4, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L95] var_1_15 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L96] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_16=4999999999999997/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L97] var_1_16 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L98] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_17=1283/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L99] var_1_17 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L100] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_18=71/8, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L101] var_1_18 = __VERIFIER_nondet_float() [L102] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L102] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_19=1025/4, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L103] var_1_19 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L104] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=-128, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L119] RET updateVariables() [L120] CALL step() [L44] COND TRUE ((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1) [L45] var_1_1 = ((var_1_4 + var_1_5) + var_1_6) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=25, var_1_8=0, var_1_9=4294967293] [L49] COND FALSE !(\read(var_1_8)) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L58] unsigned long int stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, stepLocal_0=4294967294, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L59] COND TRUE var_1_7 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=121/5, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L60] COND TRUE (var_1_13 - var_1_14) == var_1_15 [L61] var_1_12 = ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L120] RET step() [L121] CALL, EXPR property() [L111-L112] return (((((((last_1_var_1_7) > (1)) ? (last_1_var_1_7) : (1))) <= (256 + last_1_var_1_1)) ? (var_1_1 == ((signed long int) ((var_1_4 + var_1_5) + var_1_6))) : (var_1_1 == ((signed long int) var_1_6))) && (var_1_8 ? ((var_1_1 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_9) > (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11))))) ? (var_1_9) : (((((var_1_10) > (var_1_11)) ? (var_1_10) : (var_1_11)))))))) : (var_1_7 == ((unsigned long int) var_1_10))) : (var_1_7 == ((unsigned long int) var_1_11)))) && ((var_1_7 <= var_1_7) ? (((var_1_13 - var_1_14) == var_1_15) ? (var_1_12 == ((float) ((((var_1_16) > (((var_1_17 + var_1_18) - var_1_19))) ? (var_1_16) : (((var_1_17 + var_1_18) - var_1_19)))))) : (var_1_12 == ((float) var_1_19))) : (var_1_12 == ((float) var_1_16))) ; VAL [\result=0, isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L121] RET, EXPR property() [L121] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-128, last_1_var_1_7=25, var_1_10=0, var_1_11=4294967294, var_1_12=1000000000000004, var_1_16=1000000000000004, var_1_1=0, var_1_4=-536870911, var_1_5=-536870911, var_1_6=1073741822, var_1_7=4294967294, var_1_8=0, var_1_9=4294967293] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 229 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 158 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 393 ConstructedInterpolants, 0 QuantifiedInterpolants, 403 SizeOfPredicates, 0 NumberOfNonLiveVariables, 300 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 2480/2520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:23:59,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.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 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:24:01,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:24:01,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:24:01,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:24:01,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:24:01,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:24:01,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:24:01,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:24:01,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:24:01,862 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:24:01,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:24:01,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:24:01,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:24:01,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:24:01,864 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:24:01,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:24:01,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:24:01,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:24:01,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:24:01,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:24:01,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:24:01,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:24:01,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:24:01,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:24:01,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:24:01,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:24:01,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:24:01,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:24:01,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:24:01,867 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:24:01,867 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:24:01,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:24:01,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:24:01,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:24:01,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:24:01,867 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 -> 0bb8b5663ba2dc071251b4140110d0fdb4bbd97b62df4eade29867521161d85e [2025-03-04 00:24:02,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:24:02,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:24:02,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:24:02,099 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:24:02,100 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:24:02,100 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-04 00:24:03,207 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906bf3c61/0fc23056f99b4cdf808294c8e46c4ffe/FLAGa108e830c [2025-03-04 00:24:03,384 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:24:03,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i [2025-03-04 00:24:03,391 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906bf3c61/0fc23056f99b4cdf808294c8e46c4ffe/FLAGa108e830c [2025-03-04 00:24:03,757 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/906bf3c61/0fc23056f99b4cdf808294c8e46c4ffe [2025-03-04 00:24:03,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:24:03,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:24:03,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:24:03,761 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:24:03,764 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:24:03,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:03,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42186410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03, skipping insertion in model container [2025-03-04 00:24:03,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:03,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:24:03,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2025-03-04 00:24:03,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:24:03,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:24:03,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-59.i[915,928] [2025-03-04 00:24:03,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:24:03,944 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:24:03,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03 WrapperNode [2025-03-04 00:24:03,945 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:24:03,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:24:03,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:24:03,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:24:03,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:03,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:03,975 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2025-03-04 00:24:03,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:24:03,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:24:03,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:24:03,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:24:03,985 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:03,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:03,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,001 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:24:04,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,002 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,010 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,013 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,019 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,020 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,021 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:24:04,022 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:24:04,022 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:24:04,022 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:24:04,023 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (1/1) ... [2025-03-04 00:24:04,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:24:04,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:24:04,048 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:24:04,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:24:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:24:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:24:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:24:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:24:04,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:24:04,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:24:04,115 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:24:04,116 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:24:06,012 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:24:06,012 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:24:06,021 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:24:06,021 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:24:06,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:24:06 BoogieIcfgContainer [2025-03-04 00:24:06,022 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:24:06,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:24:06,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:24:06,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:24:06,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:24:03" (1/3) ... [2025-03-04 00:24:06,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ccc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:24:06, skipping insertion in model container [2025-03-04 00:24:06,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:24:03" (2/3) ... [2025-03-04 00:24:06,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ccc3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:24:06, skipping insertion in model container [2025-03-04 00:24:06,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:24:06" (3/3) ... [2025-03-04 00:24:06,030 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-59.i [2025-03-04 00:24:06,039 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:24:06,041 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-59.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:24:06,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:24:06,098 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;@373a7670, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:24:06,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:24:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:24:06,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 00:24:06,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:24:06,108 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:24:06,108 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:24:06,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:24:06,113 INFO L85 PathProgramCache]: Analyzing trace with hash -331961269, now seen corresponding path program 1 times [2025-03-04 00:24:06,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:24:06,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089324300] [2025-03-04 00:24:06,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:06,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:24:06,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:24:06,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:24:06,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:24:06,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 00:24:06,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 00:24:06,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:06,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:24:06,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:24:06,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:24:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2025-03-04 00:24:06,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:24:06,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:24:06,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089324300] [2025-03-04 00:24:06,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089324300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:24:06,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:24:06,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:24:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996999815] [2025-03-04 00:24:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:24:06,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:24:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:24:06,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:24:06,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:24:06,484 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:24:06,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:24:06,504 INFO L93 Difference]: Finished difference Result 112 states and 188 transitions. [2025-03-04 00:24:06,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:24:06,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 132 [2025-03-04 00:24:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:24:06,509 INFO L225 Difference]: With dead ends: 112 [2025-03-04 00:24:06,509 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:24:06,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:24:06,513 INFO L435 NwaCegarLoop]: 80 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, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:24:06,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:24:06,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:24:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 00:24:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:24:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2025-03-04 00:24:06,545 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 132 [2025-03-04 00:24:06,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:24:06,546 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2025-03-04 00:24:06,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-04 00:24:06,547 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2025-03-04 00:24:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 00:24:06,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:24:06,549 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:24:06,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:24:06,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:24:06,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:24:06,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:24:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 502455556, now seen corresponding path program 1 times [2025-03-04 00:24:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:24:06,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936350952] [2025-03-04 00:24:06,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:06,751 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:24:06,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:24:06,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:24:06,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:24:06,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 00:24:07,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 00:24:07,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:07,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:24:07,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 00:24:07,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:24:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-03-04 00:24:07,092 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:24:07,092 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:24:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936350952] [2025-03-04 00:24:07,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936350952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:24:07,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:24:07,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:24:07,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064360490] [2025-03-04 00:24:07,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:24:07,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:24:07,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:24:07,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:24:07,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:24:07,097 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:24:07,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:24:07,829 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2025-03-04 00:24:07,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:24:07,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2025-03-04 00:24:07,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:24:07,843 INFO L225 Difference]: With dead ends: 109 [2025-03-04 00:24:07,843 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 00:24:07,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:24:07,844 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:24:07,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 00:24:07,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 00:24:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 00:24:07,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 00:24:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2025-03-04 00:24:07,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 132 [2025-03-04 00:24:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:24:07,851 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2025-03-04 00:24:07,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-03-04 00:24:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2025-03-04 00:24:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 00:24:07,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:24:07,854 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:24:07,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:24:08,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:24:08,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:24:08,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:24:08,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1574132735, now seen corresponding path program 1 times [2025-03-04 00:24:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:24:08,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033072356] [2025-03-04 00:24:08,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:24:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:24:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:24:08,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:24:08,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:24:08,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 00:24:08,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 00:24:08,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:24:08,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:24:08,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 00:24:08,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:24:55,359 WARN L286 SmtUtils]: Spent 11.87s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)