./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-51.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_floatingpointinfluence_no-floats_file-51.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 4b836ea2f262418da81f26dbfe56a862353221b7830dc2829bc30e02d19dd77f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 22:36:41,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 22:36:41,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 22:36:41,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 22:36:41,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 22:36:41,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 22:36:41,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 22:36:41,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 22:36:41,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 22:36:41,480 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 22:36:41,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 22:36:41,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 22:36:41,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 22:36:41,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 22:36:41,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:41,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 22:36:41,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 22:36:41,483 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 22:36:41,483 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 -> 4b836ea2f262418da81f26dbfe56a862353221b7830dc2829bc30e02d19dd77f [2025-03-03 22:36:41,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 22:36:41,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 22:36:41,703 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 22:36:41,704 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 22:36:41,704 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 22:36:41,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-51.i [2025-03-03 22:36:42,864 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4b3b05c/ba1b5f9f5daa433da9ed3dba415723c7/FLAGedfa9fdeb [2025-03-03 22:36:43,121 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 22:36:43,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-51.i [2025-03-03 22:36:43,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4b3b05c/ba1b5f9f5daa433da9ed3dba415723c7/FLAGedfa9fdeb [2025-03-03 22:36:43,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc4b3b05c/ba1b5f9f5daa433da9ed3dba415723c7 [2025-03-03 22:36:43,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 22:36:43,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 22:36:43,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:43,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 22:36:43,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 22:36:43,450 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35c17b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43, skipping insertion in model container [2025-03-03 22:36:43,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,468 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 22:36:43,572 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_floatingpointinfluence_no-floats_file-51.i[916,929] [2025-03-03 22:36:43,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:43,620 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 22:36:43,627 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_floatingpointinfluence_no-floats_file-51.i[916,929] [2025-03-03 22:36:43,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 22:36:43,655 INFO L204 MainTranslator]: Completed translation [2025-03-03 22:36:43,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43 WrapperNode [2025-03-03 22:36:43,656 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 22:36:43,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:43,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 22:36:43,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 22:36:43,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,668 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,684 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-03 22:36:43,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 22:36:43,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 22:36:43,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 22:36:43,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 22:36:43,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,700 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,712 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 22:36:43,713 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,713 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 22:36:43,722 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 22:36:43,723 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 22:36:43,724 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 22:36:43,725 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (1/1) ... [2025-03-03 22:36:43,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 22:36:43,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:43,756 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 22:36:43,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 22:36:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 22:36:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 22:36:43,776 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 22:36:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 22:36:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 22:36:43,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 22:36:43,824 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 22:36:43,825 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 22:36:44,077 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 22:36:44,080 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 22:36:44,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 22:36:44,088 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 22:36:44,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:44 BoogieIcfgContainer [2025-03-03 22:36:44,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 22:36:44,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 22:36:44,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 22:36:44,094 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 22:36:44,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:36:43" (1/3) ... [2025-03-03 22:36:44,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78933c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:44, skipping insertion in model container [2025-03-03 22:36:44,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:36:43" (2/3) ... [2025-03-03 22:36:44,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78933c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:36:44, skipping insertion in model container [2025-03-03 22:36:44,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:36:44" (3/3) ... [2025-03-03 22:36:44,096 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-51.i [2025-03-03 22:36:44,108 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 22:36:44,109 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_floatingpointinfluence_no-floats_file-51.i that has 2 procedures, 59 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 22:36:44,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 22:36:44,156 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;@edc3c66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 22:36:44,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 22:36:44,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 22:36:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 22:36:44,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:44,170 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:44,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:44,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:44,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1703094911, now seen corresponding path program 1 times [2025-03-03 22:36:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:44,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649796699] [2025-03-03 22:36:44,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:44,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 22:36:44,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 22:36:44,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:44,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:44,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 22:36:44,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:44,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649796699] [2025-03-03 22:36:44,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649796699] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:36:44,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040773249] [2025-03-03 22:36:44,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:44,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:36:44,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:36:44,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:36:44,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 22:36:44,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 22:36:44,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 22:36:44,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:44,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:44,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 22:36:44,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:36:44,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 22:36:44,561 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 22:36:44,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040773249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:44,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:36:44,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 22:36:44,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770094334] [2025-03-03 22:36:44,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:44,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 22:36:44,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:44,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 22:36:44,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:44,586 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:36:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:44,606 INFO L93 Difference]: Finished difference Result 112 states and 196 transitions. [2025-03-03 22:36:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 22:36:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2025-03-03 22:36:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:44,613 INFO L225 Difference]: With dead ends: 112 [2025-03-03 22:36:44,613 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 22:36:44,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 22:36:44,618 INFO L435 NwaCegarLoop]: 83 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, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:44,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 22:36:44,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 22:36:44,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-03 22:36:44,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 22:36:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2025-03-03 22:36:44,647 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 139 [2025-03-03 22:36:44,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:44,648 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2025-03-03 22:36:44,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:36:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2025-03-03 22:36:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:36:44,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:44,651 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:44,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 22:36:44,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 22:36:44,852 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:44,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:44,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1199252969, now seen corresponding path program 1 times [2025-03-03 22:36:44,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:44,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030648358] [2025-03-03 22:36:44,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:44,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:44,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:36:45,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:36:45,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:45,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 22:36:48,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:48,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030648358] [2025-03-03 22:36:48,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030648358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:48,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:48,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 22:36:48,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261591523] [2025-03-03 22:36:48,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:48,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 22:36:48,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:48,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 22:36:48,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-03 22:36:48,242 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:36:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:49,962 INFO L93 Difference]: Finished difference Result 179 states and 254 transitions. [2025-03-03 22:36:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:36:49,962 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-03-03 22:36:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:49,965 INFO L225 Difference]: With dead ends: 179 [2025-03-03 22:36:49,965 INFO L226 Difference]: Without dead ends: 177 [2025-03-03 22:36:49,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-03 22:36:49,966 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 143 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:49,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 545 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:36:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-03 22:36:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 149. [2025-03-03 22:36:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 86 states have (on average 1.2093023255813953) internal successors, (104), 87 states have internal predecessors, (104), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 22:36:50,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 222 transitions. [2025-03-03 22:36:50,004 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 222 transitions. Word has length 140 [2025-03-03 22:36:50,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:50,005 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 222 transitions. [2025-03-03 22:36:50,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:36:50,005 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 222 transitions. [2025-03-03 22:36:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 22:36:50,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:50,007 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 22:36:50,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:50,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:50,009 INFO L85 PathProgramCache]: Analyzing trace with hash -608201494, now seen corresponding path program 1 times [2025-03-03 22:36:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:50,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275211608] [2025-03-03 22:36:50,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:50,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 22:36:50,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 22:36:50,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:50,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:36:52,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 22:36:52,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:36:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275211608] [2025-03-03 22:36:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275211608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:36:52,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:36:52,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 22:36:52,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429174833] [2025-03-03 22:36:52,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:36:52,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 22:36:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:36:52,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 22:36:52,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 22:36:52,248 INFO L87 Difference]: Start difference. First operand 149 states and 222 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:36:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:36:53,179 INFO L93 Difference]: Finished difference Result 209 states and 296 transitions. [2025-03-03 22:36:53,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 22:36:53,180 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 140 [2025-03-03 22:36:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:36:53,184 INFO L225 Difference]: With dead ends: 209 [2025-03-03 22:36:53,184 INFO L226 Difference]: Without dead ends: 207 [2025-03-03 22:36:53,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2025-03-03 22:36:53,187 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 109 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 22:36:53,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 665 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 22:36:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2025-03-03 22:36:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 139. [2025-03-03 22:36:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 76 states have (on average 1.1710526315789473) internal successors, (89), 77 states have internal predecessors, (89), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 22:36:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 207 transitions. [2025-03-03 22:36:53,215 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 207 transitions. Word has length 140 [2025-03-03 22:36:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:36:53,216 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 207 transitions. [2025-03-03 22:36:53,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 22:36:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 207 transitions. [2025-03-03 22:36:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:36:53,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:36:53,220 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:36:53,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 22:36:53,220 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:36:53,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:36:53,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1448249412, now seen corresponding path program 1 times [2025-03-03 22:36:53,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:36:53,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896164793] [2025-03-03 22:36:53,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:36:53,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:36:53,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:36:53,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:36:53,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:36:53,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 22:37:02,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:02,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896164793] [2025-03-03 22:37:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896164793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:37:02,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312255848] [2025-03-03 22:37:02,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:02,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:37:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:02,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:37:02,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:37:02,227 INFO L87 Difference]: Start difference. First operand 139 states and 207 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:37:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:20,037 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2025-03-03 22:37:20,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 22:37:20,039 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-03-03 22:37:20,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:20,041 INFO L225 Difference]: With dead ends: 208 [2025-03-03 22:37:20,042 INFO L226 Difference]: Without dead ends: 206 [2025-03-03 22:37:20,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2025-03-03 22:37:20,044 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 200 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:20,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 440 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 22:37:20,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-03 22:37:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 144. [2025-03-03 22:37:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 82 states have internal predecessors, (97), 59 states have call successors, (59), 3 states have call predecessors, (59), 3 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 22:37:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 215 transitions. [2025-03-03 22:37:20,076 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 215 transitions. Word has length 141 [2025-03-03 22:37:20,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:20,077 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 215 transitions. [2025-03-03 22:37:20,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:37:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 215 transitions. [2025-03-03 22:37:20,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:37:20,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:20,079 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:20,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 22:37:20,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:20,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1447325891, now seen corresponding path program 1 times [2025-03-03 22:37:20,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:20,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900556426] [2025-03-03 22:37:20,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:20,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:20,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:37:20,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:37:20,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:20,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 22:37:20,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384015577] [2025-03-03 22:37:20,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:20,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 22:37:20,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 22:37:20,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 22:37:20,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 22:37:20,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:37:20,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:37:20,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:20,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:20,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 22:37:20,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 22:37:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 336 proven. 54 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2025-03-03 22:37:20,869 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 22:37:25,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900556426] [2025-03-03 22:37:25,310 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 22:37:25,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384015577] [2025-03-03 22:37:25,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384015577] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 22:37:25,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 22:37:25,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2025-03-03 22:37:25,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026439197] [2025-03-03 22:37:25,311 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 22:37:25,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 22:37:25,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:25,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 22:37:25,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2025-03-03 22:37:25,312 INFO L87 Difference]: Start difference. First operand 144 states and 215 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 22:37:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:26,310 INFO L93 Difference]: Finished difference Result 291 states and 417 transitions. [2025-03-03 22:37:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 22:37:26,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 141 [2025-03-03 22:37:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:26,313 INFO L225 Difference]: With dead ends: 291 [2025-03-03 22:37:26,314 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 22:37:26,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=58, Invalid=123, Unknown=1, NotChecked=0, Total=182 [2025-03-03 22:37:26,316 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:26,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 135 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 22:37:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 22:37:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 156. [2025-03-03 22:37:26,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 91 states have internal predecessors, (103), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 22:37:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 221 transitions. [2025-03-03 22:37:26,350 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 221 transitions. Word has length 141 [2025-03-03 22:37:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:26,350 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 221 transitions. [2025-03-03 22:37:26,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2025-03-03 22:37:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 221 transitions. [2025-03-03 22:37:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 22:37:26,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:26,352 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:26,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 22:37:26,556 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-03 22:37:26,556 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:26,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:26,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1644762917, now seen corresponding path program 1 times [2025-03-03 22:37:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47337971] [2025-03-03 22:37:26,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:26,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:26,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 22:37:26,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 22:37:26,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:26,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 22:37:31,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:31,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47337971] [2025-03-03 22:37:31,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47337971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:31,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:31,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:37:31,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525140798] [2025-03-03 22:37:31,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:31,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:37:31,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:31,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:37:31,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:37:31,847 INFO L87 Difference]: Start difference. First operand 156 states and 221 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:37:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:39,414 INFO L93 Difference]: Finished difference Result 279 states and 369 transitions. [2025-03-03 22:37:39,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 22:37:39,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 141 [2025-03-03 22:37:39,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:39,417 INFO L225 Difference]: With dead ends: 279 [2025-03-03 22:37:39,417 INFO L226 Difference]: Without dead ends: 277 [2025-03-03 22:37:39,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2025-03-03 22:37:39,418 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 141 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:39,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 824 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-03 22:37:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-03 22:37:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 154. [2025-03-03 22:37:39,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 89 states have internal predecessors, (100), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 22:37:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 218 transitions. [2025-03-03 22:37:39,447 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 218 transitions. Word has length 141 [2025-03-03 22:37:39,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:39,448 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 218 transitions. [2025-03-03 22:37:39,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:37:39,448 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 218 transitions. [2025-03-03 22:37:39,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:37:39,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:39,450 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:39,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 22:37:39,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1716385114, now seen corresponding path program 1 times [2025-03-03 22:37:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625443670] [2025-03-03 22:37:39,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:39,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:39,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:37:39,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:37:39,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:39,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:37:48,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 22:37:48,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 22:37:48,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625443670] [2025-03-03 22:37:48,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625443670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 22:37:48,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 22:37:48,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 22:37:48,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043331444] [2025-03-03 22:37:48,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 22:37:48,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 22:37:48,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 22:37:48,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 22:37:48,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 22:37:48,248 INFO L87 Difference]: Start difference. First operand 154 states and 218 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:37:57,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 22:37:57,884 INFO L93 Difference]: Finished difference Result 349 states and 481 transitions. [2025-03-03 22:37:57,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 22:37:57,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 142 [2025-03-03 22:37:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 22:37:57,886 INFO L225 Difference]: With dead ends: 349 [2025-03-03 22:37:57,886 INFO L226 Difference]: Without dead ends: 222 [2025-03-03 22:37:57,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2025-03-03 22:37:57,889 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 135 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-03 22:37:57,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 569 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-03 22:37:57,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-03 22:37:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 162. [2025-03-03 22:37:57,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 97 states have internal predecessors, (110), 59 states have call successors, (59), 6 states have call predecessors, (59), 6 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 22:37:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 228 transitions. [2025-03-03 22:37:57,930 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 228 transitions. Word has length 142 [2025-03-03 22:37:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 22:37:57,931 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 228 transitions. [2025-03-03 22:37:57,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 22:37:57,931 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 228 transitions. [2025-03-03 22:37:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 22:37:57,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 22:37:57,932 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 22:37:57,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 22:37:57,932 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 22:37:57,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 22:37:57,933 INFO L85 PathProgramCache]: Analyzing trace with hash 26425221, now seen corresponding path program 1 times [2025-03-03 22:37:57,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 22:37:57,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048231489] [2025-03-03 22:37:57,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 22:37:57,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 22:37:57,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 22:37:57,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 22:37:57,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 22:37:57,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 22:38:08,192 WARN L286 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 100 DAG size of output: 82 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)