./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.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 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:27:55,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:27:55,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:27:55,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:27:55,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:27:55,554 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:27:55,555 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:27:55,555 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:27:55,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:27:55,556 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:27:55,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:27:55,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:27:55,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:27:55,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:27:55,557 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:27:55,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:27:55,558 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:27:55,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:27:55,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:27:55,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:27:55,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:27:55,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:27:55,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:27:55,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:27:55,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:55,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:27:55,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:27:55,560 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 -> 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 [2025-03-04 00:27:55,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:27:55,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:27:55,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:27:55,782 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:27:55,783 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:27:55,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-03-04 00:27:56,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0ac9e1c/9b76f91b9ceb45e9bb3c82d3c9b6adc4/FLAG00cba13c9 [2025-03-04 00:27:57,143 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:27:57,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-03-04 00:27:57,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0ac9e1c/9b76f91b9ceb45e9bb3c82d3c9b6adc4/FLAG00cba13c9 [2025-03-04 00:27:57,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca0ac9e1c/9b76f91b9ceb45e9bb3c82d3c9b6adc4 [2025-03-04 00:27:57,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:27:57,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:27:57,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:57,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:27:57,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:27:57,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd39b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57, skipping insertion in model container [2025-03-04 00:27:57,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:27:57,283 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-03-04 00:27:57,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:57,335 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:27:57,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-03-04 00:27:57,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:27:57,382 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:27:57,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57 WrapperNode [2025-03-04 00:27:57,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:27:57,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:57,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:27:57,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:27:57,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,419 INFO L138 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-03-04 00:27:57,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:27:57,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:27:57,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:27:57,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:27:57,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:27:57,450 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,450 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,454 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:27:57,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:27:57,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:27:57,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:27:57,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (1/1) ... [2025-03-04 00:27:57,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:27:57,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:57,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:27:57,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:27:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:27:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:27:57,516 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:27:57,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:27:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:27:57,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:27:57,566 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:27:57,568 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:27:57,727 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L75: havoc property_#t~bitwise8#1;havoc property_#t~short9#1; [2025-03-04 00:27:57,741 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-04 00:27:57,742 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:27:57,753 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:27:57,753 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:27:57,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:57 BoogieIcfgContainer [2025-03-04 00:27:57,753 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:27:57,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:27:57,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:27:57,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:27:57,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:27:57" (1/3) ... [2025-03-04 00:27:57,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f29b713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:57, skipping insertion in model container [2025-03-04 00:27:57,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:27:57" (2/3) ... [2025-03-04 00:27:57,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f29b713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:27:57, skipping insertion in model container [2025-03-04 00:27:57,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:57" (3/3) ... [2025-03-04 00:27:57,762 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-9.i [2025-03-04 00:27:57,774 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:27:57,776 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-9.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:27:57,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:27:57,822 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;@c32af7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:27:57,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:27:57,826 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 00:27:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 00:27:57,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:57,833 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:57,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:57,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:57,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1294960015, now seen corresponding path program 1 times [2025-03-04 00:27:57,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171663310] [2025-03-04 00:27:57,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:57,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 00:27:57,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 00:27:57,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:57,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:58,011 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 00:27:58,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:58,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171663310] [2025-03-04 00:27:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171663310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:27:58,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549385122] [2025-03-04 00:27:58,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:58,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:27:58,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:27:58,017 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:27:58,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:27:58,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 00:27:58,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 00:27:58,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:58,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:58,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:27:58,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:27:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 00:27:58,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:27:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549385122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:58,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:27:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:27:58,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390031186] [2025-03-04 00:27:58,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:58,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:27:58,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:58,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:27:58,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:27:58,144 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.375) internal successors, (44), 33 states have internal predecessors, (44), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 00:27:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:58,166 INFO L93 Difference]: Finished difference Result 74 states and 108 transitions. [2025-03-04 00:27:58,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:27:58,167 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 45 [2025-03-04 00:27:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:58,172 INFO L225 Difference]: With dead ends: 74 [2025-03-04 00:27:58,172 INFO L226 Difference]: Without dead ends: 37 [2025-03-04 00:27:58,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:27:58,178 INFO L435 NwaCegarLoop]: 47 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, 47 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-04 00:27:58,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:27:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-04 00:27:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-04 00:27:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 00:27:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2025-03-04 00:27:58,208 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 45 [2025-03-04 00:27:58,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:58,208 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2025-03-04 00:27:58,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 00:27:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2025-03-04 00:27:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 00:27:58,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:58,210 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:58,220 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-04 00:27:58,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:27:58,411 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:58,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash -842889362, now seen corresponding path program 1 times [2025-03-04 00:27:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:58,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594361811] [2025-03-04 00:27:58,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:58,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:58,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 00:27:58,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 00:27:58,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:58,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 00:27:58,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:58,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594361811] [2025-03-04 00:27:58,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594361811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:58,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:58,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:27:58,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013932230] [2025-03-04 00:27:58,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:58,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:27:58,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:58,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:27:58,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:27:58,594 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:27:58,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:58,668 INFO L93 Difference]: Finished difference Result 119 states and 158 transitions. [2025-03-04 00:27:58,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:27:58,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2025-03-04 00:27:58,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:58,670 INFO L225 Difference]: With dead ends: 119 [2025-03-04 00:27:58,670 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 00:27:58,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:27:58,671 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:58,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 135 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:27:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 00:27:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2025-03-04 00:27:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:27:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2025-03-04 00:27:58,688 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 45 [2025-03-04 00:27:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:58,689 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2025-03-04 00:27:58,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:27:58,689 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2025-03-04 00:27:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 00:27:58,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:58,689 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:58,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:27:58,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:58,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:58,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1995460737, now seen corresponding path program 1 times [2025-03-04 00:27:58,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:58,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858868210] [2025-03-04 00:27:58,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:58,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:58,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 00:27:58,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 00:27:58,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:58,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:27:58,827 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 00:27:58,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:27:58,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858868210] [2025-03-04 00:27:58,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858868210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:27:58,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:27:58,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:27:58,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496181570] [2025-03-04 00:27:58,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:27:58,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:27:58,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:27:58,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:27:58,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:27:58,829 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:27:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:27:58,863 INFO L93 Difference]: Finished difference Result 153 states and 207 transitions. [2025-03-04 00:27:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:27:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-03-04 00:27:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:27:58,865 INFO L225 Difference]: With dead ends: 153 [2025-03-04 00:27:58,865 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 00:27:58,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:27:58,866 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 43 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:27:58,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 87 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:27:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 00:27:58,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2025-03-04 00:27:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:27:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2025-03-04 00:27:58,883 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 46 [2025-03-04 00:27:58,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:27:58,884 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2025-03-04 00:27:58,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:27:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2025-03-04 00:27:58,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 00:27:58,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:27:58,886 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:27:58,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:27:58,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:27:58,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:27:58,887 INFO L85 PathProgramCache]: Analyzing trace with hash 308108421, now seen corresponding path program 1 times [2025-03-04 00:27:58,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:27:58,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380348414] [2025-03-04 00:27:58,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:27:58,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:27:58,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 00:27:58,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 00:27:58,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:27:58,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 00:28:00,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:28:00,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380348414] [2025-03-04 00:28:00,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380348414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:00,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:00,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 00:28:00,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348021583] [2025-03-04 00:28:00,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:00,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:28:00,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:28:00,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:28:00,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:28:00,044 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:00,179 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2025-03-04 00:28:00,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 00:28:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2025-03-04 00:28:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:00,180 INFO L225 Difference]: With dead ends: 152 [2025-03-04 00:28:00,182 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 00:28:00,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:28:00,183 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:00,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 217 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:28:00,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 00:28:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2025-03-04 00:28:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:28:00,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2025-03-04 00:28:00,194 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 47 [2025-03-04 00:28:00,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:00,195 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2025-03-04 00:28:00,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2025-03-04 00:28:00,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 00:28:00,196 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:00,196 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:28:00,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:28:00,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:00,197 INFO L85 PathProgramCache]: Analyzing trace with hash 550189584, now seen corresponding path program 1 times [2025-03-04 00:28:00,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:28:00,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527663912] [2025-03-04 00:28:00,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:28:00,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:28:00,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:28:00,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:00,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 00:28:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [45042620] [2025-03-04 00:28:00,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:00,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:28:00,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:28:00,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:28:00,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:28:00,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:28:00,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:28:00,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:00,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:28:00,294 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:28:00,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 00:28:00,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 00:28:00,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:00,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:28:00,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:28:00,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:28:00,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:28:00,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 00:28:00,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:28:00,543 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 00:28:00,567 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:28:00,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:28:00 BoogieIcfgContainer [2025-03-04 00:28:00,569 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:28:00,570 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:28:00,570 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:28:00,570 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:28:00,571 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:27:57" (3/4) ... [2025-03-04 00:28:00,573 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:28:00,573 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:28:00,574 INFO L158 Benchmark]: Toolchain (without parser) took 3410.14ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 65.7MB in the end (delta: 89.0MB). Peak memory consumption was 90.3MB. Max. memory is 16.1GB. [2025-03-04 00:28:00,574 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:00,574 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.48ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 142.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:00,574 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.37ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:00,574 INFO L158 Benchmark]: Boogie Preprocessor took 33.05ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 137.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:00,574 INFO L158 Benchmark]: IcfgBuilder took 295.48ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 121.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:28:00,575 INFO L158 Benchmark]: TraceAbstraction took 2813.50ms. Allocated memory is still 201.3MB. Free memory was 120.9MB in the beginning and 65.8MB in the end (delta: 55.2MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2025-03-04 00:28:00,575 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 201.3MB. Free memory was 65.8MB in the beginning and 65.7MB in the end (delta: 60.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:00,576 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.43ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.48ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 142.3MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.37ms. Allocated memory is still 201.3MB. Free memory was 142.3MB in the beginning and 140.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.05ms. Allocated memory is still 201.3MB. Free memory was 140.2MB in the beginning and 137.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 295.48ms. Allocated memory is still 201.3MB. Free memory was 137.8MB in the beginning and 121.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2813.50ms. Allocated memory is still 201.3MB. Free memory was 120.9MB in the beginning and 65.8MB in the end (delta: 55.2MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 201.3MB. Free memory was 65.8MB in the beginning and 65.7MB in the end (delta: 60.0kB). 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 shiftLeft at line 50, overapproximation of shiftLeft at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 10; [L23] unsigned char var_1_3 = 4; [L24] unsigned char var_1_7 = 0; [L25] signed short int var_1_8 = 100; [L26] unsigned char var_1_9 = 32; [L27] double var_1_10 = 9.2; [L28] double var_1_11 = 0.975; [L29] signed short int var_1_12 = 1; [L30] signed short int last_1_var_1_8 = 100; [L31] double last_1_var_1_10 = 9.2; VAL [isInitial=0, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L79] isInitial = 1 [L80] FCALL initially() [L81] COND TRUE 1 [L82] CALL updateLastVariables() [L71] last_1_var_1_8 = var_1_8 [L72] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L82] RET updateLastVariables() [L83] CALL updateVariables() [L61] var_1_3 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L62] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_7=0, var_1_8=100, var_1_9=32] [L63] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L63] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L64] var_1_7 = __VERIFIER_nondet_uchar() [L65] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L65] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_8=100, var_1_9=32] [L66] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L66] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_11=39/40, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L67] var_1_11 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L68] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L83] RET updateVariables() [L84] CALL step() [L35] COND FALSE !(last_1_var_1_8 <= 16) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=10, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L38] COND FALSE !(((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) [L45] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=46/5, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=32] [L48] var_1_9 = 64 [L49] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=64] [L50] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=100, var_1_9=64] [L50] COND TRUE (10 << var_1_9) < (var_1_3 * var_1_1) [L51] var_1_8 = (var_1_9 + var_1_1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L53] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, stepLocal_0=1, var_1_10=2, var_1_11=2, var_1_12=1, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L54] COND TRUE ((var_1_1 + var_1_9) < 10) || stepLocal_0 [L55] var_1_12 = ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L84] RET step() [L85] CALL, EXPR property() [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75] EXPR 10 << var_1_9 VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75] EXPR ((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L75-L76] return (((((last_1_var_1_8 <= 16) ? (var_1_1 == ((unsigned char) var_1_3)) : ((((((last_1_var_1_10) > (last_1_var_1_10)) ? (last_1_var_1_10) : (last_1_var_1_10))) < last_1_var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3))) : (var_1_1 == ((unsigned char) var_1_3)))) && (((10 << var_1_9) < (var_1_3 * var_1_1)) ? (var_1_8 == ((signed short int) (var_1_9 + var_1_1))) : 1)) && (var_1_9 == ((unsigned char) 64))) && (var_1_10 == ((double) var_1_11))) && ((((var_1_1 + var_1_9) < 10) || (var_1_10 > var_1_10)) ? (var_1_12 == ((signed short int) ((((var_1_8) > (var_1_1)) ? (var_1_8) : (var_1_1))))) : (var_1_12 == ((signed short int) var_1_8))) ; [L85] RET, EXPR property() [L85] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=46/5, last_1_var_1_8=100, var_1_10=2, var_1_11=2, var_1_12=68, var_1_1=4, var_1_3=4, var_1_7=0, var_1_8=68, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 166 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 486 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 286 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 135 IncrementalHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 200 mSDtfsCounter, 135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 223 ConstructedInterpolants, 0 QuantifiedInterpolants, 438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 133 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 192/200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 00:28:00,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.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 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:28:02,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:28:02,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:28:02,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:28:02,522 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:28:02,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:28:02,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:28:02,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:28:02,546 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:28:02,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:28:02,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:28:02,546 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:28:02,547 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:28:02,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:28:02,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:28:02,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:28:02,548 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 -> 2af4ef02d2ea167c3c28149dc3ff530f0194e8e0dcdfa97ac5fed6a48df73da2 [2025-03-04 00:28:02,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:28:02,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:28:02,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:28:02,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:28:02,803 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:28:02,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-03-04 00:28:03,947 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8400417/4fc7b7f52a254cdfb54129f61222519e/FLAG6bcbb4fed [2025-03-04 00:28:04,110 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:28:04,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i [2025-03-04 00:28:04,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8400417/4fc7b7f52a254cdfb54129f61222519e/FLAG6bcbb4fed [2025-03-04 00:28:04,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc8400417/4fc7b7f52a254cdfb54129f61222519e [2025-03-04 00:28:04,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:28:04,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:28:04,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:28:04,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:28:04,516 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:28:04,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,517 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@143f2e26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04, skipping insertion in model container [2025-03-04 00:28:04,517 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:28:04,612 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-03-04 00:28:04,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:28:04,639 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:28:04,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-9.i[914,927] [2025-03-04 00:28:04,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:28:04,669 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:28:04,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04 WrapperNode [2025-03-04 00:28:04,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:28:04,670 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:28:04,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:28:04,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:28:04,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,683 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,695 INFO L138 Inliner]: procedures = 27, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 72 [2025-03-04 00:28:04,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:28:04,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:28:04,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:28:04,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:28:04,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,702 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,707 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,725 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:28:04,725 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,725 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,741 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:28:04,741 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:28:04,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:28:04,742 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:28:04,742 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (1/1) ... [2025-03-04 00:28:04,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:28:04,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:28:04,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:28:04,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:28:04,788 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:28:04,789 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:28:04,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:28:04,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:28:04,842 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:28:04,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:28:04,994 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-04 00:28:04,994 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:28:05,000 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:28:05,000 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:28:05,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:28:05 BoogieIcfgContainer [2025-03-04 00:28:05,000 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:28:05,002 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:28:05,002 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:28:05,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:28:05,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:28:04" (1/3) ... [2025-03-04 00:28:05,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6575ff5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:28:05, skipping insertion in model container [2025-03-04 00:28:05,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:28:04" (2/3) ... [2025-03-04 00:28:05,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6575ff5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:28:05, skipping insertion in model container [2025-03-04 00:28:05,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:28:05" (3/3) ... [2025-03-04 00:28:05,008 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-9.i [2025-03-04 00:28:05,017 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:28:05,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-9.i that has 2 procedures, 33 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:28:05,048 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:28:05,056 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;@2b52109c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:28:05,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:28:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 00:28:05,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 00:28:05,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:05,066 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:28:05,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:05,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:05,069 INFO L85 PathProgramCache]: Analyzing trace with hash -947004480, now seen corresponding path program 1 times [2025-03-04 00:28:05,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:28:05,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001486200] [2025-03-04 00:28:05,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:05,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:05,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:28:05,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:28:05,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 00:28:05,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 00:28:05,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 00:28:05,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:05,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:05,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:28:05,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:05,198 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 00:28:05,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:28:05,199 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:28:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001486200] [2025-03-04 00:28:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001486200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:28:05,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232230388] [2025-03-04 00:28:05,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:05,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:28:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:28:05,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:28:05,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:28:05,216 INFO L87 Difference]: Start difference. First operand has 33 states, 25 states have (on average 1.36) internal successors, (34), 26 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 00:28:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:05,226 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2025-03-04 00:28:05,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:28:05,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-04 00:28:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:05,231 INFO L225 Difference]: With dead ends: 59 [2025-03-04 00:28:05,232 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 00:28:05,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:28:05,235 INFO L435 NwaCegarLoop]: 36 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, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:05,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:28:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 00:28:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 00:28:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 00:28:05,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2025-03-04 00:28:05,262 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 42 [2025-03-04 00:28:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2025-03-04 00:28:05,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 00:28:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2025-03-04 00:28:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 00:28:05,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:05,266 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:28:05,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 00:28:05,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:05,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:05,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:05,468 INFO L85 PathProgramCache]: Analyzing trace with hash -415089087, now seen corresponding path program 1 times [2025-03-04 00:28:05,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:28:05,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038208967] [2025-03-04 00:28:05,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:28:05,471 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:28:05,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 00:28:05,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 00:28:05,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 00:28:05,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:05,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:05,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 00:28:05,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 00:28:05,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:28:05,689 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:28:05,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038208967] [2025-03-04 00:28:05,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1038208967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:05,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:05,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:28:05,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509773329] [2025-03-04 00:28:05,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:05,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:28:05,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:28:05,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:28:05,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:28:05,693 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:05,770 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2025-03-04 00:28:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:28:05,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2025-03-04 00:28:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:05,771 INFO L225 Difference]: With dead ends: 90 [2025-03-04 00:28:05,771 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 00:28:05,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:28:05,776 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:05,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 89 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:28:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 00:28:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2025-03-04 00:28:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:28:05,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2025-03-04 00:28:05,783 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 42 [2025-03-04 00:28:05,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:05,784 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2025-03-04 00:28:05,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:05,784 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2025-03-04 00:28:05,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 00:28:05,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:05,784 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:28:05,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-04 00:28:05,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:05,985 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:05,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:05,986 INFO L85 PathProgramCache]: Analyzing trace with hash -324216829, now seen corresponding path program 1 times [2025-03-04 00:28:05,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:28:05,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328047796] [2025-03-04 00:28:05,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:05,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:05,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:28:05,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:28:05,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 00:28:06,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 00:28:06,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 00:28:06,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:06,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:06,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 00:28:06,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 00:28:06,110 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:28:06,110 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:28:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328047796] [2025-03-04 00:28:06,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328047796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:06,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:06,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:28:06,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393302733] [2025-03-04 00:28:06,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:06,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:28:06,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:28:06,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:28:06,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:28:06,111 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:06,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:06,188 INFO L93 Difference]: Finished difference Result 120 states and 152 transitions. [2025-03-04 00:28:06,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:28:06,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-03-04 00:28:06,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:06,190 INFO L225 Difference]: With dead ends: 120 [2025-03-04 00:28:06,190 INFO L226 Difference]: Without dead ends: 70 [2025-03-04 00:28:06,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:28:06,192 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:06,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 110 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:28:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-04 00:28:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2025-03-04 00:28:06,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:28:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2025-03-04 00:28:06,204 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 43 [2025-03-04 00:28:06,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:06,204 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2025-03-04 00:28:06,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2025-03-04 00:28:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 00:28:06,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:06,205 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:28:06,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2025-03-04 00:28:06,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:06,406 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:06,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash -323293308, now seen corresponding path program 1 times [2025-03-04 00:28:06,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:28:06,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131582750] [2025-03-04 00:28:06,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:06,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:06,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:28:06,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:28:06,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 00:28:06,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 00:28:06,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 00:28:06,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:06,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:06,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:28:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:09,511 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 00:28:09,511 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:28:09,511 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:28:09,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131582750] [2025-03-04 00:28:09,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131582750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:09,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:09,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:28:09,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620769252] [2025-03-04 00:28:09,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:09,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:28:09,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:28:09,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:28:09,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:28:09,513 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:10,150 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2025-03-04 00:28:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:28:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-03-04 00:28:10,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:10,152 INFO L225 Difference]: With dead ends: 77 [2025-03-04 00:28:10,152 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 00:28:10,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:28:10,152 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:10,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 108 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:28:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 00:28:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2025-03-04 00:28:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 00:28:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-04 00:28:10,166 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 43 [2025-03-04 00:28:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:10,166 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-04 00:28:10,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:10,166 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-04 00:28:10,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 00:28:10,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:28:10,168 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:28:10,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:28:10,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:10,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:28:10,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:28:10,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1210796989, now seen corresponding path program 1 times [2025-03-04 00:28:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:28:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376312065] [2025-03-04 00:28:10,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:28:10,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:10,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:28:10,373 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 00:28:10,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 00:28:10,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 00:28:10,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 00:28:10,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:28:10,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:28:10,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 00:28:10,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:28:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 00:28:13,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:28:13,629 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:28:13,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376312065] [2025-03-04 00:28:13,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376312065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:28:13,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:28:13,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 00:28:13,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411441027] [2025-03-04 00:28:13,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:28:13,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:28:13,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:28:13,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:28:13,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 00:28:13,631 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:28:14,150 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-03-04 00:28:14,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 00:28:14,151 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 43 [2025-03-04 00:28:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:28:14,151 INFO L225 Difference]: With dead ends: 75 [2025-03-04 00:28:14,151 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 00:28:14,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-04 00:28:14,152 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 42 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 00:28:14,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 113 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 00:28:14,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 00:28:14,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 00:28:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 00:28:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 00:28:14,153 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2025-03-04 00:28:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:28:14,153 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 00:28:14,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 00:28:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 00:28:14,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 00:28:14,155 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:28:14,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:28:14,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 00:28:14,359 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 00:28:14,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 00:28:15,164 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:28:15,171 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,173 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2025-03-04 00:28:15,174 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2025-03-04 00:28:15,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:28:15 BoogieIcfgContainer [2025-03-04 00:28:15,175 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:28:15,176 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:28:15,176 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:28:15,176 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:28:15,177 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:28:05" (3/4) ... [2025-03-04 00:28:15,178 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 00:28:15,182 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 00:28:15,185 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 00:28:15,186 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 00:28:15,186 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 00:28:15,186 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 00:28:15,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 00:28:15,250 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 00:28:15,250 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:28:15,251 INFO L158 Benchmark]: Toolchain (without parser) took 10738.89ms. Allocated memory was 117.4MB in the beginning and 788.5MB in the end (delta: 671.1MB). Free memory was 92.9MB in the beginning and 346.7MB in the end (delta: -253.8MB). Peak memory consumption was 416.5MB. Max. memory is 16.1GB. [2025-03-04 00:28:15,251 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:15,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 157.05ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 80.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:15,252 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.71ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:15,252 INFO L158 Benchmark]: Boogie Preprocessor took 44.32ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:28:15,253 INFO L158 Benchmark]: IcfgBuilder took 259.07ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 63.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:15,253 INFO L158 Benchmark]: TraceAbstraction took 10172.95ms. Allocated memory was 117.4MB in the beginning and 788.5MB in the end (delta: 671.1MB). Free memory was 63.4MB in the beginning and 354.8MB in the end (delta: -291.3MB). Peak memory consumption was 383.0MB. Max. memory is 16.1GB. [2025-03-04 00:28:15,253 INFO L158 Benchmark]: Witness Printer took 74.46ms. Allocated memory is still 788.5MB. Free memory was 354.8MB in the beginning and 346.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 00:28:15,254 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.16ms. Allocated memory is still 83.9MB. Free memory is still 62.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 157.05ms. Allocated memory is still 117.4MB. Free memory was 92.9MB in the beginning and 80.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.71ms. Allocated memory is still 117.4MB. Free memory was 80.2MB in the beginning and 78.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.32ms. Allocated memory is still 117.4MB. Free memory was 78.8MB in the beginning and 77.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 259.07ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 63.9MB in the end (delta: 13.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10172.95ms. Allocated memory was 117.4MB in the beginning and 788.5MB in the end (delta: 671.1MB). Free memory was 63.4MB in the beginning and 354.8MB in the end (delta: -291.3MB). Peak memory consumption was 383.0MB. Max. memory is 16.1GB. * Witness Printer took 74.46ms. Allocated memory is still 788.5MB. Free memory was 354.8MB in the beginning and 346.7MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 181 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 456 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 338 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 163 mSDtfsCounter, 338 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, InterpolantAutomatonStates: 40, 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, 5 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 1095 SizeOfPredicates, 21 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 200/200 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 81]: Location Invariant Derived location invariant: (((100 == last_1_var_1_8) && (var_1_8 == 100)) || (((var_1_10 == var_1_11) && (var_1_1 == var_1_3)) && (var_1_9 == 64))) RESULT: Ultimate proved your program to be correct! [2025-03-04 00:28:15,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE