./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.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 a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:10:18,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:10:18,325 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 16:10:18,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:10:18,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:10:18,352 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:10:18,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:10:18,354 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:10:18,354 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:10:18,354 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:10:18,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:10:18,355 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:10:18,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:10:18,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:10:18,355 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:10:18,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:10:18,356 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:10:18,356 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:10:18,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 16:10:18,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:10:18,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:10:18,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:10:18,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:10:18,357 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:10:18,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:10:18,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:10:18,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:10:18,359 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 -> a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce [2025-03-08 16:10:18,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:10:18,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:10:18,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:10:18,634 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:10:18,634 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:10:18,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2025-03-08 16:10:19,803 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15db6d83a/14a0e5b9d8d34fad80028da927ac4ac5/FLAG63faa2944 [2025-03-08 16:10:20,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:10:20,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2025-03-08 16:10:20,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15db6d83a/14a0e5b9d8d34fad80028da927ac4ac5/FLAG63faa2944 [2025-03-08 16:10:20,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15db6d83a/14a0e5b9d8d34fad80028da927ac4ac5 [2025-03-08 16:10:20,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:10:20,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:10:20,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:10:20,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:10:20,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:10:20,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a7d990 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20, skipping insertion in model container [2025-03-08 16:10:20,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,382 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:10:20,465 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_variablewrapping_normal_file-82.i[913,926] [2025-03-08 16:10:20,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:10:20,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:10:20,518 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_variablewrapping_normal_file-82.i[913,926] [2025-03-08 16:10:20,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:10:20,551 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:10:20,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20 WrapperNode [2025-03-08 16:10:20,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:10:20,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:10:20,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:10:20,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:10:20,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,568 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,595 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2025-03-08 16:10:20,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:10:20,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:10:20,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:10:20,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:10:20,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,607 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,620 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:10:20,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,630 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,634 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,638 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,643 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:10:20,644 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:10:20,644 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:10:20,644 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:10:20,648 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (1/1) ... [2025-03-08 16:10:20,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:10:20,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:10:20,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:10:20,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:10:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:10:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:10:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:10:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 16:10:20,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:10:20,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:10:20,747 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:10:20,749 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:10:20,953 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-08 16:10:20,978 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 16:10:20,978 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:10:20,997 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:10:20,999 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:10:21,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:10:20 BoogieIcfgContainer [2025-03-08 16:10:21,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:10:21,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:10:21,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:10:21,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:10:21,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:10:20" (1/3) ... [2025-03-08 16:10:21,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e56695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:10:21, skipping insertion in model container [2025-03-08 16:10:21,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:20" (2/3) ... [2025-03-08 16:10:21,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e56695a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:10:21, skipping insertion in model container [2025-03-08 16:10:21,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:10:20" (3/3) ... [2025-03-08 16:10:21,009 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-82.i [2025-03-08 16:10:21,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:10:21,022 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-82.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:10:21,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:10:21,079 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;@4aa8c554, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:10:21,081 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:10:21,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:10:21,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 16:10:21,091 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:21,091 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:21,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:21,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:21,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1697843616, now seen corresponding path program 1 times [2025-03-08 16:10:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:10:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252704740] [2025-03-08 16:10:21,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:21,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:10:21,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 16:10:21,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 16:10:21,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:21,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:21,298 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:10:21,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:10:21,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252704740] [2025-03-08 16:10:21,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252704740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 16:10:21,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518955536] [2025-03-08 16:10:21,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:21,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 16:10:21,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:10:21,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 16:10:21,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 16:10:21,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 16:10:21,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 16:10:21,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:21,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:21,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:10:21,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:10:21,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:10:21,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518955536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:21,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 16:10:21,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 16:10:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472499512] [2025-03-08 16:10:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:21,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:10:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:10:21,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:10:21,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:10:21,460 INFO L87 Difference]: Start difference. First operand has 57 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:10:21,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:21,478 INFO L93 Difference]: Finished difference Result 108 states and 175 transitions. [2025-03-08 16:10:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:10:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2025-03-08 16:10:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:21,487 INFO L225 Difference]: With dead ends: 108 [2025-03-08 16:10:21,487 INFO L226 Difference]: Without dead ends: 54 [2025-03-08 16:10:21,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:10:21,491 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:21,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:10:21,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-08 16:10:21,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-08 16:10:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:10:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2025-03-08 16:10:21,517 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 95 [2025-03-08 16:10:21,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:21,518 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2025-03-08 16:10:21,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 16:10:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2025-03-08 16:10:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 16:10:21,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:21,523 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:21,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 16:10:21,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 16:10:21,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:21,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash -330914782, now seen corresponding path program 1 times [2025-03-08 16:10:21,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:10:21,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827164565] [2025-03-08 16:10:21,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:21,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:10:21,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 16:10:21,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 16:10:21,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:21,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:10:22,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:10:22,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827164565] [2025-03-08 16:10:22,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827164565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:22,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:22,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 16:10:22,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701937347] [2025-03-08 16:10:22,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:22,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:10:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:10:22,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:10:22,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:10:22,109 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:22,210 INFO L93 Difference]: Finished difference Result 123 states and 177 transitions. [2025-03-08 16:10:22,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:10:22,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-03-08 16:10:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:22,212 INFO L225 Difference]: With dead ends: 123 [2025-03-08 16:10:22,212 INFO L226 Difference]: Without dead ends: 72 [2025-03-08 16:10:22,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:10:22,213 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:22,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 268 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:10:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-08 16:10:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2025-03-08 16:10:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:10:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2025-03-08 16:10:22,219 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 83 transitions. Word has length 95 [2025-03-08 16:10:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:22,220 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 83 transitions. [2025-03-08 16:10:22,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 83 transitions. [2025-03-08 16:10:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:10:22,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:22,221 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:22,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 16:10:22,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:22,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:22,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1007924832, now seen corresponding path program 1 times [2025-03-08 16:10:22,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:10:22,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138235750] [2025-03-08 16:10:22,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:22,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:10:22,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:10:22,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:10:22,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:22,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:22,487 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:10:22,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 16:10:22,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138235750] [2025-03-08 16:10:22,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138235750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:22,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:22,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 16:10:22,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078261279] [2025-03-08 16:10:22,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:22,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 16:10:22,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 16:10:22,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 16:10:22,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 16:10:22,488 INFO L87 Difference]: Start difference. First operand 58 states and 83 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:22,687 INFO L93 Difference]: Finished difference Result 181 states and 258 transitions. [2025-03-08 16:10:22,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 16:10:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2025-03-08 16:10:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:22,689 INFO L225 Difference]: With dead ends: 181 [2025-03-08 16:10:22,689 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 16:10:22,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-08 16:10:22,690 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 75 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:22,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 280 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 16:10:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 16:10:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 115. [2025-03-08 16:10:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 84 states have internal predecessors, (108), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:10:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2025-03-08 16:10:22,704 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 97 [2025-03-08 16:10:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:22,704 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2025-03-08 16:10:22,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2025-03-08 16:10:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 16:10:22,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:22,705 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:22,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 16:10:22,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:22,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash -878842113, now seen corresponding path program 1 times [2025-03-08 16:10:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 16:10:22,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895945399] [2025-03-08 16:10:22,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:22,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 16:10:22,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:10:22,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:10:22,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:22,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:10:22,791 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 16:10:22,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 16:10:22,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 16:10:22,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:22,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 16:10:22,865 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 16:10:22,865 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 16:10:22,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 16:10:22,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 16:10:22,871 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 16:10:22,936 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 16:10:22,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:10:22 BoogieIcfgContainer [2025-03-08 16:10:22,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 16:10:22,939 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 16:10:22,939 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 16:10:22,939 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 16:10:22,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:10:20" (3/4) ... [2025-03-08 16:10:22,942 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 16:10:22,943 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 16:10:22,944 INFO L158 Benchmark]: Toolchain (without parser) took 2580.54ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 74.7MB in the end (delta: 30.4MB). Peak memory consumption was 34.9MB. Max. memory is 16.1GB. [2025-03-08 16:10:22,944 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:10:22,945 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.79ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 91.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:10:22,945 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.46ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 88.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:10:22,946 INFO L158 Benchmark]: Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 84.5MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 16:10:22,946 INFO L158 Benchmark]: IcfgBuilder took 356.06ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 63.5MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 16:10:22,946 INFO L158 Benchmark]: TraceAbstraction took 1937.34ms. Allocated memory is still 142.6MB. Free memory was 62.4MB in the beginning and 74.7MB in the end (delta: -12.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:10:22,947 INFO L158 Benchmark]: Witness Printer took 3.89ms. Allocated memory is still 142.6MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 16:10:22,947 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.55ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.79ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 91.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.46ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 88.6MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.89ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 84.5MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 356.06ms. Allocated memory is still 142.6MB. Free memory was 84.5MB in the beginning and 63.5MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1937.34ms. Allocated memory is still 142.6MB. Free memory was 62.4MB in the beginning and 74.7MB in the end (delta: -12.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.89ms. Allocated memory is still 142.6MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 76, overapproximation of someBinaryFLOATComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 99. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 128.75; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 63.5; [L25] float var_1_4 = 255.5; [L26] unsigned char var_1_5 = 32; [L27] unsigned char var_1_9 = 25; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 16; [L30] unsigned char var_1_12 = 2; [L31] unsigned char var_1_14 = 5; [L32] unsigned char var_1_15 = 10; [L33] double var_1_16 = 3.75; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 255.5; [L36] unsigned char last_1_var_1_5 = 32; [L37] unsigned char last_1_var_1_12 = 2; [L38] unsigned char last_1_var_1_17 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L94] last_1_var_1_5 = var_1_5 [L95] last_1_var_1_12 = var_1_12 [L96] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L71] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L72] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_3=127/2, var_1_4=511/2, var_1_5=32, var_1_9=25] [L73] var_1_3 = __VERIFIER_nondet_float() [L74] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L74] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_4=511/2, var_1_5=32, var_1_9=25] [L75] var_1_4 = __VERIFIER_nondet_float() [L76] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L76] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=25] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=128, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L81] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=16, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L83] var_1_11 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L84] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L85] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L85] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=5, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L86] var_1_14 = __VERIFIER_nondet_uchar() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L88] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L88] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=10, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L91] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L91] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L107] RET updateVariables() [L108] CALL step() [L42] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=32, var_1_9=254] [L42] signed long int stepLocal_0 = last_1_var_1_17 | last_1_var_1_12; [L43] COND FALSE !((last_1_var_1_5 / -2) >= stepLocal_0) [L46] var_1_5 = (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=253, var_1_9=254] [L48] COND FALSE !(! var_1_2) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=15/4, var_1_17=0, var_1_18=511/2, var_1_1=515/4, var_1_2=1, var_1_5=253, var_1_9=254] [L53] var_1_16 = var_1_4 [L54] var_1_17 = var_1_9 [L55] var_1_18 = var_1_3 [L56] unsigned char stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, stepLocal_1=254, var_1_10=253, var_1_11=0, var_1_12=2, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L57] COND FALSE !((var_1_5 + var_1_11) >= stepLocal_1) [L66] var_1_12 = var_1_9 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L99] EXPR last_1_var_1_17 | last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L99] EXPR ((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L99-L100] return ((((((! var_1_2) ? (var_1_2 ? (var_1_1 == ((float) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : 1) : 1) && (((last_1_var_1_5 / -2) >= (last_1_var_1_17 | last_1_var_1_12)) ? (var_1_5 == ((unsigned char) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) : (var_1_5 == ((unsigned char) (var_1_10 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))))) && (((var_1_5 + var_1_11) >= var_1_9) ? ((((((var_1_4) > ((var_1_1 * var_1_3))) ? (var_1_4) : ((var_1_1 * var_1_3)))) <= var_1_1) ? (var_1_12 == ((unsigned char) ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))))) : (var_1_2 ? (var_1_12 == ((unsigned char) (var_1_11 + var_1_15))) : 1)) : (var_1_12 == ((unsigned char) var_1_9)))) && (var_1_16 == ((double) var_1_4))) && (var_1_17 == ((unsigned char) var_1_9))) && (var_1_18 == ((double) var_1_3)) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_17=0, last_1_var_1_5=32, var_1_10=253, var_1_11=0, var_1_12=254, var_1_14=1, var_1_15=127, var_1_16=261, var_1_17=254, var_1_18=260, var_1_1=515/4, var_1_2=1, var_1_3=260, var_1_4=261, var_1_5=253, var_1_9=254] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 97 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 96 mSDsluCounter, 624 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 403 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 221 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 3 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 378 ConstructedInterpolants, 0 QuantifiedInterpolants, 622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1430/1456 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 16:10:22,963 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_variablewrapping_normal_file-82.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 a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 16:10:24,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 16:10:24,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 16:10:24,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 16:10:24,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 16:10:24,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 16:10:24,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 16:10:24,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 16:10:24,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 16:10:24,848 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 16:10:24,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 16:10:24,849 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 16:10:24,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 16:10:24,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 16:10:24,849 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 16:10:24,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 16:10:24,851 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 16:10:24,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 16:10:24,852 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 16:10:24,852 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 16:10:24,852 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 16:10:24,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 16:10:24,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 16:10:24,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 16:10:24,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:10:24,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 16:10:24,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 16:10:24,854 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 16:10:24,855 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 -> a9a450555877b28033d09a5f84176dfa3dbe8a5a81fc1d86d82c451af47112ce [2025-03-08 16:10:25,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 16:10:25,108 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 16:10:25,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 16:10:25,112 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 16:10:25,113 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 16:10:25,114 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2025-03-08 16:10:26,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdce19b69/c791e5bb83e54ee1acae13c71939adf4/FLAGf797f8c49 [2025-03-08 16:10:26,433 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 16:10:26,434 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-82.i [2025-03-08 16:10:26,441 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdce19b69/c791e5bb83e54ee1acae13c71939adf4/FLAGf797f8c49 [2025-03-08 16:10:26,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdce19b69/c791e5bb83e54ee1acae13c71939adf4 [2025-03-08 16:10:26,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 16:10:26,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 16:10:26,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 16:10:26,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 16:10:26,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 16:10:26,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:26,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1acd7ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26, skipping insertion in model container [2025-03-08 16:10:26,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:26,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 16:10:26,921 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_variablewrapping_normal_file-82.i[913,926] [2025-03-08 16:10:26,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:10:26,958 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 16:10:26,966 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_variablewrapping_normal_file-82.i[913,926] [2025-03-08 16:10:26,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 16:10:26,990 INFO L204 MainTranslator]: Completed translation [2025-03-08 16:10:26,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26 WrapperNode [2025-03-08 16:10:26,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 16:10:26,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 16:10:26,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 16:10:26,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 16:10:26,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,008 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,026 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2025-03-08 16:10:27,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 16:10:27,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 16:10:27,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 16:10:27,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 16:10:27,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,035 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,043 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 16:10:27,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,057 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,062 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,068 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 16:10:27,068 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 16:10:27,068 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 16:10:27,069 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 16:10:27,069 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (1/1) ... [2025-03-08 16:10:27,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 16:10:27,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 16:10:27,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 16:10:27,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 16:10:27,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 16:10:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 16:10:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 16:10:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 16:10:27,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 16:10:27,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 16:10:27,173 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 16:10:27,174 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 16:10:28,234 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 16:10:28,234 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 16:10:28,240 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 16:10:28,240 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 16:10:28,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:10:28 BoogieIcfgContainer [2025-03-08 16:10:28,241 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 16:10:28,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 16:10:28,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 16:10:28,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 16:10:28,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:10:26" (1/3) ... [2025-03-08 16:10:28,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ee3c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:10:28, skipping insertion in model container [2025-03-08 16:10:28,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:10:26" (2/3) ... [2025-03-08 16:10:28,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ee3c24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:10:28, skipping insertion in model container [2025-03-08 16:10:28,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:10:28" (3/3) ... [2025-03-08 16:10:28,248 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-82.i [2025-03-08 16:10:28,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 16:10:28,259 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-82.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 16:10:28,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 16:10:28,308 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;@68497453, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 16:10:28,308 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 16:10:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:10:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 16:10:28,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:28,319 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:28,320 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:28,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash -532682735, now seen corresponding path program 1 times [2025-03-08 16:10:28,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:28,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878459880] [2025-03-08 16:10:28,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:28,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:28,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:28,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:10:28,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 16:10:28,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 16:10:28,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 16:10:28,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:28,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:28,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 16:10:28,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-08 16:10:28,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:10:28,520 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:10:28,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878459880] [2025-03-08 16:10:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878459880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:28,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:28,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 16:10:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686045831] [2025-03-08 16:10:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:28,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 16:10:28,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:10:28,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 16:10:28,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:10:28,539 INFO L87 Difference]: Start difference. First operand has 47 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:28,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:28,553 INFO L93 Difference]: Finished difference Result 88 states and 145 transitions. [2025-03-08 16:10:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 16:10:28,554 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-03-08 16:10:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:28,558 INFO L225 Difference]: With dead ends: 88 [2025-03-08 16:10:28,558 INFO L226 Difference]: Without dead ends: 44 [2025-03-08 16:10:28,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 16:10:28,565 INFO L435 NwaCegarLoop]: 63 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, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:28,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 16:10:28,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-08 16:10:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-08 16:10:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-08 16:10:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2025-03-08 16:10:28,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2025-03-08 16:10:28,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:28,617 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2025-03-08 16:10:28,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:28,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2025-03-08 16:10:28,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 16:10:28,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:28,619 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:28,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 16:10:28,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:28,823 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:28,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:28,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1280653613, now seen corresponding path program 1 times [2025-03-08 16:10:28,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:28,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817046632] [2025-03-08 16:10:28,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:28,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:28,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:28,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:10:28,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 16:10:28,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 16:10:28,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 16:10:28,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:28,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:28,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 16:10:28,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 16:10:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 16:10:29,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 16:10:29,257 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 16:10:29,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817046632] [2025-03-08 16:10:29,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817046632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 16:10:29,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 16:10:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 16:10:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057770189] [2025-03-08 16:10:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 16:10:29,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 16:10:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 16:10:29,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 16:10:29,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 16:10:29,261 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:30,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 16:10:30,584 INFO L93 Difference]: Finished difference Result 127 states and 184 transitions. [2025-03-08 16:10:30,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 16:10:30,595 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2025-03-08 16:10:30,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 16:10:30,597 INFO L225 Difference]: With dead ends: 127 [2025-03-08 16:10:30,597 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 16:10:30,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 16:10:30,598 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 16:10:30,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 199 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 16:10:30,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 16:10:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2025-03-08 16:10:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 16:10:30,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 105 transitions. [2025-03-08 16:10:30,610 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 105 transitions. Word has length 91 [2025-03-08 16:10:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 16:10:30,610 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 105 transitions. [2025-03-08 16:10:30,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-08 16:10:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 105 transitions. [2025-03-08 16:10:30,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 16:10:30,612 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 16:10:30,612 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 16:10:30,618 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-08 16:10:30,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:30,816 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 16:10:30,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 16:10:30,817 INFO L85 PathProgramCache]: Analyzing trace with hash 462156722, now seen corresponding path program 1 times [2025-03-08 16:10:30,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 16:10:30,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376828920] [2025-03-08 16:10:30,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 16:10:30,817 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 16:10:30,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 16:10:30,819 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 16:10:30,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 16:10:30,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 16:10:30,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 16:10:30,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 16:10:30,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 16:10:30,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 16:10:30,952 INFO L279 TraceCheckSpWp]: Computing forward predicates...