./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.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 a9f11f8c88de8998bc882c7dd2efba11633c83e29912cc5a80cdbf720cc0a7ec --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:24:41,326 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:24:41,385 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:24:41,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:24:41,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:24:41,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:24:41,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:24:41,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:24:41,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:24:41,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:24:41,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:24:41,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:24:41,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:24:41,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:24:41,418 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:24:41,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:24:41,419 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:24:41,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:24:41,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:24:41,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:24:41,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:24:41,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:24:41,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:24:41,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:41,421 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:24:41,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:24:41,421 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 -> a9f11f8c88de8998bc882c7dd2efba11633c83e29912cc5a80cdbf720cc0a7ec [2025-03-08 15:24:41,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:24:41,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:24:41,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:24:41,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:24:41,629 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:24:41,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.i [2025-03-08 15:24:42,761 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff519898/eb49caf1d82d416b978d0796ddc39161/FLAGe8f73e5d3 [2025-03-08 15:24:43,052 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:24:43,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-64.i [2025-03-08 15:24:43,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff519898/eb49caf1d82d416b978d0796ddc39161/FLAGe8f73e5d3 [2025-03-08 15:24:43,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ff519898/eb49caf1d82d416b978d0796ddc39161 [2025-03-08 15:24:43,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:24:43,083 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:24:43,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:43,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:24:43,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:24:43,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef3eaba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43, skipping insertion in model container [2025-03-08 15:24:43,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:24:43,223 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_amount250_file-64.i[916,929] [2025-03-08 15:24:43,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:43,370 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:24:43,381 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_amount250_file-64.i[916,929] [2025-03-08 15:24:43,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:24:43,444 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:24:43,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43 WrapperNode [2025-03-08 15:24:43,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:24:43,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:43,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:24:43,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:24:43,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,540 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 369 [2025-03-08 15:24:43,540 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:24:43,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:24:43,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:24:43,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:24:43,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,594 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 15:24:43,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,614 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,621 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:24:43,646 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:24:43,646 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:24:43,646 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:24:43,647 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (1/1) ... [2025-03-08 15:24:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:24:43,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:43,672 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:24:43,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:24:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:24:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:24:43,692 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:24:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:24:43,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:24:43,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:24:43,785 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:24:43,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:24:44,323 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L350: havoc property_#t~ite30#1;havoc property_#t~bitwise28#1;havoc property_#t~bitwise29#1;havoc property_#t~short31#1; [2025-03-08 15:24:44,400 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-08 15:24:44,400 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:24:44,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:24:44,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:24:44,419 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:44 BoogieIcfgContainer [2025-03-08 15:24:44,419 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:24:44,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:24:44,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:24:44,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:24:44,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:24:43" (1/3) ... [2025-03-08 15:24:44,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76373512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:44, skipping insertion in model container [2025-03-08 15:24:44,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:24:43" (2/3) ... [2025-03-08 15:24:44,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76373512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:24:44, skipping insertion in model container [2025-03-08 15:24:44,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:24:44" (3/3) ... [2025-03-08 15:24:44,426 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-64.i [2025-03-08 15:24:44,436 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:24:44,437 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-64.i that has 2 procedures, 152 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:24:44,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:24:44,489 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;@6535653e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:24:44,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:24:44,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 152 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 111 states have internal predecessors, (168), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:24:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-08 15:24:44,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:44,512 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:44,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:44,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1062474065, now seen corresponding path program 1 times [2025-03-08 15:24:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785182141] [2025-03-08 15:24:44,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:44,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:44,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 15:24:44,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 15:24:44,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:44,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-08 15:24:44,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:44,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785182141] [2025-03-08 15:24:44,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785182141] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:44,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349759360] [2025-03-08 15:24:44,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:44,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:44,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:44,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:24:44,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:24:45,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 15:24:45,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 15:24:45,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:45,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:45,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:24:45,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:45,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 2888 trivial. 0 not checked. [2025-03-08 15:24:45,170 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:24:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349759360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:45,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:24:45,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:24:45,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463962071] [2025-03-08 15:24:45,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:45,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:24:45,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:45,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:24:45,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:24:45,193 INFO L87 Difference]: Start difference. First operand has 152 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 111 states have internal predecessors, (168), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:24:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:45,225 INFO L93 Difference]: Finished difference Result 298 states and 526 transitions. [2025-03-08 15:24:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:24:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) Word has length 260 [2025-03-08 15:24:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:45,233 INFO L225 Difference]: With dead ends: 298 [2025-03-08 15:24:45,234 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 15:24:45,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:24:45,242 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:45,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 15:24:45,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2025-03-08 15:24:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 108 states have (on average 1.5092592592592593) internal successors, (163), 108 states have internal predecessors, (163), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:24:45,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 241 transitions. [2025-03-08 15:24:45,281 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 241 transitions. Word has length 260 [2025-03-08 15:24:45,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:45,281 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 241 transitions. [2025-03-08 15:24:45,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (39), 2 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 15:24:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 241 transitions. [2025-03-08 15:24:45,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-08 15:24:45,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:45,286 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:45,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:24:45,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:24:45,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:45,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1555505836, now seen corresponding path program 1 times [2025-03-08 15:24:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:45,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764897441] [2025-03-08 15:24:45,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:45,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 15:24:45,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 15:24:45,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:45,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:45,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:24:45,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:45,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764897441] [2025-03-08 15:24:45,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764897441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:45,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:45,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:45,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239129387] [2025-03-08 15:24:45,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:45,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:45,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:45,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:45,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:45,773 INFO L87 Difference]: Start difference. First operand 149 states and 241 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:45,841 INFO L93 Difference]: Finished difference Result 373 states and 609 transitions. [2025-03-08 15:24:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:45,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 260 [2025-03-08 15:24:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:45,847 INFO L225 Difference]: With dead ends: 373 [2025-03-08 15:24:45,849 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 15:24:45,850 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:45,850 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 121 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:45,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 466 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 15:24:45,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 169. [2025-03-08 15:24:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 128 states have (on average 1.5390625) internal successors, (197), 128 states have internal predecessors, (197), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:24:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 275 transitions. [2025-03-08 15:24:45,872 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 275 transitions. Word has length 260 [2025-03-08 15:24:45,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:45,874 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 275 transitions. [2025-03-08 15:24:45,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 275 transitions. [2025-03-08 15:24:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-08 15:24:45,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:45,880 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:45,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:24:45,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:45,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1225740075, now seen corresponding path program 1 times [2025-03-08 15:24:45,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:45,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136646887] [2025-03-08 15:24:45,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:45,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-08 15:24:45,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-08 15:24:45,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:45,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:46,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:24:46,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:46,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136646887] [2025-03-08 15:24:46,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136646887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:46,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:24:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622286691] [2025-03-08 15:24:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:46,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:24:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:46,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:24:46,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:46,120 INFO L87 Difference]: Start difference. First operand 169 states and 275 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:46,178 INFO L93 Difference]: Finished difference Result 393 states and 642 transitions. [2025-03-08 15:24:46,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:24:46,178 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 260 [2025-03-08 15:24:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:46,182 INFO L225 Difference]: With dead ends: 393 [2025-03-08 15:24:46,183 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 15:24:46,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:24:46,184 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 118 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:46,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 575 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:46,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 15:24:46,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 175. [2025-03-08 15:24:46,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 134 states have (on average 1.544776119402985) internal successors, (207), 134 states have internal predecessors, (207), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-08 15:24:46,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 285 transitions. [2025-03-08 15:24:46,203 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 285 transitions. Word has length 260 [2025-03-08 15:24:46,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:46,204 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 285 transitions. [2025-03-08 15:24:46,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:46,205 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 285 transitions. [2025-03-08 15:24:46,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-08 15:24:46,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:46,208 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:46,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:24:46,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:46,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1207671567, now seen corresponding path program 1 times [2025-03-08 15:24:46,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:46,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464125585] [2025-03-08 15:24:46,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:46,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:46,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-08 15:24:46,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-08 15:24:46,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:46,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:24:46,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:46,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464125585] [2025-03-08 15:24:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464125585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858784145] [2025-03-08 15:24:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:46,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:46,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:46,721 INFO L87 Difference]: Start difference. First operand 175 states and 285 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:46,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:46,979 INFO L93 Difference]: Finished difference Result 568 states and 927 transitions. [2025-03-08 15:24:46,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:46,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 262 [2025-03-08 15:24:46,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:46,982 INFO L225 Difference]: With dead ends: 568 [2025-03-08 15:24:46,982 INFO L226 Difference]: Without dead ends: 396 [2025-03-08 15:24:46,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 15:24:46,985 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 363 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:46,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 652 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:24:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2025-03-08 15:24:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 382. [2025-03-08 15:24:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 301 states have (on average 1.5614617940199336) internal successors, (470), 301 states have internal predecessors, (470), 78 states have call successors, (78), 2 states have call predecessors, (78), 2 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:24:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 626 transitions. [2025-03-08 15:24:47,023 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 626 transitions. Word has length 262 [2025-03-08 15:24:47,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:47,024 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 626 transitions. [2025-03-08 15:24:47,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:47,024 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 626 transitions. [2025-03-08 15:24:47,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-08 15:24:47,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:47,027 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:47,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:24:47,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:47,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1139203314, now seen corresponding path program 1 times [2025-03-08 15:24:47,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:47,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145500913] [2025-03-08 15:24:47,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:47,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:47,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 15:24:47,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 15:24:47,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:47,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:24:47,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145500913] [2025-03-08 15:24:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145500913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:24:47,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:24:47,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:24:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749869224] [2025-03-08 15:24:47,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:24:47,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:24:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:47,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:24:47,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:24:47,663 INFO L87 Difference]: Start difference. First operand 382 states and 626 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:47,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:47,735 INFO L93 Difference]: Finished difference Result 886 states and 1444 transitions. [2025-03-08 15:24:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:24:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 263 [2025-03-08 15:24:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:47,741 INFO L225 Difference]: With dead ends: 886 [2025-03-08 15:24:47,741 INFO L226 Difference]: Without dead ends: 507 [2025-03-08 15:24:47,743 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-08 15:24:47,744 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 137 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:47,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 672 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:24:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-03-08 15:24:47,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 504. [2025-03-08 15:24:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 400 states have (on average 1.5375) internal successors, (615), 401 states have internal predecessors, (615), 99 states have call successors, (99), 4 states have call predecessors, (99), 4 states have return successors, (99), 98 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-08 15:24:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 813 transitions. [2025-03-08 15:24:47,784 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 813 transitions. Word has length 263 [2025-03-08 15:24:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:47,784 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 813 transitions. [2025-03-08 15:24:47,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:24:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 813 transitions. [2025-03-08 15:24:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-08 15:24:47,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:47,789 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:47,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:24:47,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:47,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1910999501, now seen corresponding path program 1 times [2025-03-08 15:24:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:47,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929824104] [2025-03-08 15:24:47,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:47,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 15:24:48,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 15:24:48,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:48,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 18 proven. 96 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-03-08 15:24:55,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:24:55,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929824104] [2025-03-08 15:24:55,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929824104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:24:55,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476922801] [2025-03-08 15:24:55,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:55,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:24:55,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:24:55,847 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-08 15:24:55,848 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-08 15:24:55,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 15:24:56,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 15:24:56,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:56,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:24:56,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:24:56,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:24:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2025-03-08 15:24:56,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:24:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2025-03-08 15:24:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476922801] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:24:56,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:24:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 16 [2025-03-08 15:24:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046908032] [2025-03-08 15:24:56,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:24:56,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 15:24:56,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:24:56,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 15:24:56,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2025-03-08 15:24:56,446 INFO L87 Difference]: Start difference. First operand 504 states and 813 transitions. Second operand has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 4 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2025-03-08 15:24:59,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:24:59,640 INFO L93 Difference]: Finished difference Result 1204 states and 1918 transitions. [2025-03-08 15:24:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 15:24:59,640 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 4 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) Word has length 263 [2025-03-08 15:24:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:24:59,644 INFO L225 Difference]: With dead ends: 1204 [2025-03-08 15:24:59,644 INFO L226 Difference]: Without dead ends: 703 [2025-03-08 15:24:59,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 527 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=370, Invalid=1270, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 15:24:59,647 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 2350 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2371 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 2398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:24:59,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2371 Valid, 1933 Invalid, 2398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 15:24:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2025-03-08 15:24:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 364. [2025-03-08 15:24:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 279 states have (on average 1.4838709677419355) internal successors, (414), 279 states have internal predecessors, (414), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:24:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 570 transitions. [2025-03-08 15:24:59,672 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 570 transitions. Word has length 263 [2025-03-08 15:24:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:24:59,672 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 570 transitions. [2025-03-08 15:24:59,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.9375) internal successors, (127), 16 states have internal predecessors, (127), 4 states have call successors, (95), 2 states have call predecessors, (95), 4 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2025-03-08 15:24:59,673 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 570 transitions. [2025-03-08 15:24:59,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-08 15:24:59,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:24:59,674 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:24:59,682 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-08 15:24:59,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-08 15:24:59,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:24:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:24:59,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1795556647, now seen corresponding path program 1 times [2025-03-08 15:24:59,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:24:59,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66592138] [2025-03-08 15:24:59,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:24:59,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:24:59,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-03-08 15:24:59,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-03-08 15:24:59,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:24:59,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:25:00,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:00,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66592138] [2025-03-08 15:25:00,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66592138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:00,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:00,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:25:00,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383428789] [2025-03-08 15:25:00,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:00,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:25:00,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:00,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:25:00,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:25:00,165 INFO L87 Difference]: Start difference. First operand 364 states and 570 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:25:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:00,325 INFO L93 Difference]: Finished difference Result 586 states and 921 transitions. [2025-03-08 15:25:00,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:25:00,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 263 [2025-03-08 15:25:00,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:00,327 INFO L225 Difference]: With dead ends: 586 [2025-03-08 15:25:00,328 INFO L226 Difference]: Without dead ends: 357 [2025-03-08 15:25:00,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 15:25:00,329 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 184 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:00,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 649 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:25:00,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-08 15:25:00,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 345. [2025-03-08 15:25:00,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 260 states have (on average 1.4653846153846153) internal successors, (381), 260 states have internal predecessors, (381), 78 states have call successors, (78), 6 states have call predecessors, (78), 6 states have return successors, (78), 78 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-08 15:25:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 537 transitions. [2025-03-08 15:25:00,369 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 537 transitions. Word has length 263 [2025-03-08 15:25:00,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:00,369 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 537 transitions. [2025-03-08 15:25:00,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:25:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 537 transitions. [2025-03-08 15:25:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-08 15:25:00,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:00,374 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:00,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:25:00,374 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:00,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:00,375 INFO L85 PathProgramCache]: Analyzing trace with hash -533338570, now seen corresponding path program 1 times [2025-03-08 15:25:00,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:00,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303079645] [2025-03-08 15:25:00,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:00,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:00,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-08 15:25:00,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-08 15:25:00,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:00,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:00,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:25:00,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:00,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303079645] [2025-03-08 15:25:00,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303079645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:00,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:00,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:25:00,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376576653] [2025-03-08 15:25:00,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:00,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:25:00,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:00,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:25:00,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:25:00,615 INFO L87 Difference]: Start difference. First operand 345 states and 537 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:25:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:00,780 INFO L93 Difference]: Finished difference Result 785 states and 1237 transitions. [2025-03-08 15:25:00,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:25:00,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 265 [2025-03-08 15:25:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:00,784 INFO L225 Difference]: With dead ends: 785 [2025-03-08 15:25:00,784 INFO L226 Difference]: Without dead ends: 573 [2025-03-08 15:25:00,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 15:25:00,785 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 353 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:00,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 655 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:25:00,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-08 15:25:00,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 512. [2025-03-08 15:25:00,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 386 states have (on average 1.455958549222798) internal successors, (562), 386 states have internal predecessors, (562), 117 states have call successors, (117), 8 states have call predecessors, (117), 8 states have return successors, (117), 117 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-08 15:25:00,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 796 transitions. [2025-03-08 15:25:00,812 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 796 transitions. Word has length 265 [2025-03-08 15:25:00,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:00,812 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 796 transitions. [2025-03-08 15:25:00,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:25:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 796 transitions. [2025-03-08 15:25:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-08 15:25:00,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:00,815 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:00,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:25:00,815 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:00,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2007527208, now seen corresponding path program 1 times [2025-03-08 15:25:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:00,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804192205] [2025-03-08 15:25:00,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:00,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:00,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-08 15:25:00,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-08 15:25:00,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:00,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2025-03-08 15:25:01,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:25:01,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804192205] [2025-03-08 15:25:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804192205] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:25:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:25:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:25:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861198946] [2025-03-08 15:25:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:25:01,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:25:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:25:01,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:25:01,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:25:01,038 INFO L87 Difference]: Start difference. First operand 512 states and 796 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:25:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:25:01,196 INFO L93 Difference]: Finished difference Result 1281 states and 2010 transitions. [2025-03-08 15:25:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:25:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 265 [2025-03-08 15:25:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:25:01,202 INFO L225 Difference]: With dead ends: 1281 [2025-03-08 15:25:01,202 INFO L226 Difference]: Without dead ends: 884 [2025-03-08 15:25:01,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-08 15:25:01,205 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 316 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:25:01,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 658 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:25:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-03-08 15:25:01,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 826. [2025-03-08 15:25:01,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 618 states have (on average 1.4611650485436893) internal successors, (903), 618 states have internal predecessors, (903), 195 states have call successors, (195), 12 states have call predecessors, (195), 12 states have return successors, (195), 195 states have call predecessors, (195), 195 states have call successors, (195) [2025-03-08 15:25:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1293 transitions. [2025-03-08 15:25:01,245 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1293 transitions. Word has length 265 [2025-03-08 15:25:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:25:01,246 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1293 transitions. [2025-03-08 15:25:01,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2025-03-08 15:25:01,246 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1293 transitions. [2025-03-08 15:25:01,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 15:25:01,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:25:01,250 INFO L218 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:25:01,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:25:01,250 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:25:01,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:25:01,251 INFO L85 PathProgramCache]: Analyzing trace with hash -496751334, now seen corresponding path program 1 times [2025-03-08 15:25:01,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:25:01,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992280045] [2025-03-08 15:25:01,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:01,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:25:01,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 15:25:01,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 15:25:01,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:01,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:25:01,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141854807] [2025-03-08 15:25:01,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:25:01,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:25:01,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:25:01,626 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:25:01,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:25:01,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 15:25:01,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 15:25:01,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:25:01,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:25:01,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-08 15:25:01,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:25:06,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1732 proven. 213 refuted. 0 times theorem prover too weak. 1019 trivial. 0 not checked. [2025-03-08 15:25:06,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:25:27,857 WARN L286 SmtUtils]: Spent 20.16s on a formula simplification. DAG size of input: 89 DAG size of output: 52 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 15:25:41,309 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:26:09,384 WARN L286 SmtUtils]: Spent 16.40s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 15:26:17,334 WARN L286 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)