./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-4.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 86050a320677a833f953e3d24f630a372e53eb7ac1e89a394e20853921226e93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:32:32,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:32:32,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:32:32,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:32:32,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:32:32,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:32:32,664 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:32:32,664 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:32:32,665 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:32:32,665 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:32:32,666 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:32:32,666 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:32:32,666 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:32:32,666 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:32:32,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:32:32,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:32:32,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:32:32,668 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:32:32,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:32:32,668 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:32:32,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:32:32,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:32:32,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:32:32,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:32:32,669 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:32:32,669 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 -> 86050a320677a833f953e3d24f630a372e53eb7ac1e89a394e20853921226e93 [2025-03-04 00:32:32,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:32:32,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:32:32,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:32:32,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:32:32,912 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:32:32,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-4.i [2025-03-04 00:32:34,126 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becc05122/612d5043a4b54758b8108a9a2b8aaeaf/FLAG2f085af07 [2025-03-04 00:32:34,448 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:32:34,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-4.i [2025-03-04 00:32:34,460 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becc05122/612d5043a4b54758b8108a9a2b8aaeaf/FLAG2f085af07 [2025-03-04 00:32:34,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/becc05122/612d5043a4b54758b8108a9a2b8aaeaf [2025-03-04 00:32:34,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:32:34,474 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:32:34,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:32:34,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:32:34,479 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:32:34,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:32:34" (1/1) ... [2025-03-04 00:32:34,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@716ceec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:34, skipping insertion in model container [2025-03-04 00:32:34,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:32:34" (1/1) ... [2025-03-04 00:32:34,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:32:34,632 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_amount500_file-4.i[915,928] [2025-03-04 00:32:34,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:32:34,884 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:32:34,892 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_amount500_file-4.i[915,928] [2025-03-04 00:32:34,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:32:35,011 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:32:35,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35 WrapperNode [2025-03-04 00:32:35,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:32:35,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:32:35,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:32:35,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:32:35,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,137 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 621 [2025-03-04 00:32:35,138 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:32:35,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:32:35,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:32:35,139 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:32:35,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,250 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 00:32:35,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:32:35,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:32:35,323 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:32:35,323 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:32:35,324 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (1/1) ... [2025-03-04 00:32:35,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:32:35,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:35,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 00:32:35,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 00:32:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:32:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:32:35,373 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:32:35,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:32:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:32:35,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:32:35,491 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:32:35,493 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:32:36,366 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L643: havoc property_#t~bitwise42#1;havoc property_#t~short43#1;havoc property_#t~ite45#1;havoc property_#t~bitwise44#1;havoc property_#t~short46#1; [2025-03-04 00:32:36,500 INFO L? ?]: Removed 91 outVars from TransFormulas that were not future-live. [2025-03-04 00:32:36,500 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:32:36,525 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:32:36,526 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:32:36,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:32:36 BoogieIcfgContainer [2025-03-04 00:32:36,526 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:32:36,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:32:36,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:32:36,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:32:36,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:32:34" (1/3) ... [2025-03-04 00:32:36,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eb20cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:32:36, skipping insertion in model container [2025-03-04 00:32:36,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:32:35" (2/3) ... [2025-03-04 00:32:36,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47eb20cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:32:36, skipping insertion in model container [2025-03-04 00:32:36,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:32:36" (3/3) ... [2025-03-04 00:32:36,535 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-4.i [2025-03-04 00:32:36,547 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:32:36,550 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-4.i that has 2 procedures, 241 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:32:36,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:32:36,620 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;@3ee253de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:32:36,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:32:36,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 241 states, 177 states have (on average 1.5423728813559323) internal successors, (273), 178 states have internal predecessors, (273), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:32:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-04 00:32:36,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:36,645 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:36,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:36,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash 765449289, now seen corresponding path program 1 times [2025-03-04 00:32:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:36,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943939497] [2025-03-04 00:32:36,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:36,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:36,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-04 00:32:36,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 00:32:36,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:36,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:37,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:32:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:37,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943939497] [2025-03-04 00:32:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943939497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:37,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984751692] [2025-03-04 00:32:37,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:37,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:37,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:37,202 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:32:37,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 00:32:37,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-04 00:32:37,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 00:32:37,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:37,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:37,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1139 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:32:37,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-03-04 00:32:37,623 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:32:37,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984751692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:37,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:32:37,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:32:37,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258680150] [2025-03-04 00:32:37,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:37,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:32:37,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:37,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:32:37,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:32:37,658 INFO L87 Difference]: Start difference. First operand has 241 states, 177 states have (on average 1.5423728813559323) internal successors, (273), 178 states have internal predecessors, (273), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:37,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:37,731 INFO L93 Difference]: Finished difference Result 474 states and 842 transitions. [2025-03-04 00:32:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:32:37,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 428 [2025-03-04 00:32:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:37,746 INFO L225 Difference]: With dead ends: 474 [2025-03-04 00:32:37,746 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 00:32:37,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:32:37,756 INFO L435 NwaCegarLoop]: 381 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, 381 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-04 00:32:37,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 381 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:32:37,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 00:32:37,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-03-04 00:32:37,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 173 states have (on average 1.5202312138728324) internal successors, (263), 173 states have internal predecessors, (263), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-03-04 00:32:37,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 385 transitions. [2025-03-04 00:32:37,826 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 385 transitions. Word has length 428 [2025-03-04 00:32:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:37,826 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 385 transitions. [2025-03-04 00:32:37,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.0) internal successors, (128), 2 states have internal predecessors, (128), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:32:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 385 transitions. [2025-03-04 00:32:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-04 00:32:37,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:37,840 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:37,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:32:38,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 00:32:38,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:38,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1517809774, now seen corresponding path program 1 times [2025-03-04 00:32:38,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:38,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550292796] [2025-03-04 00:32:38,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:38,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:38,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-04 00:32:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 00:32:38,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:38,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:38,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:38,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550292796] [2025-03-04 00:32:38,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550292796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:38,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:38,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:32:38,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329609207] [2025-03-04 00:32:38,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:38,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:32:38,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:38,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:32:38,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:38,631 INFO L87 Difference]: Start difference. First operand 236 states and 385 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:38,786 INFO L93 Difference]: Finished difference Result 600 states and 981 transitions. [2025-03-04 00:32:38,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:32:38,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-03-04 00:32:38,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:38,792 INFO L225 Difference]: With dead ends: 600 [2025-03-04 00:32:38,794 INFO L226 Difference]: Without dead ends: 367 [2025-03-04 00:32:38,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:38,796 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 167 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:38,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 812 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:38,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-03-04 00:32:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 364. [2025-03-04 00:32:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 296 states have (on average 1.5574324324324325) internal successors, (461), 297 states have internal predecessors, (461), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-04 00:32:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 591 transitions. [2025-03-04 00:32:38,836 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 591 transitions. Word has length 428 [2025-03-04 00:32:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:38,838 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 591 transitions. [2025-03-04 00:32:38,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:38,839 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 591 transitions. [2025-03-04 00:32:38,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-04 00:32:38,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:38,845 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:38,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 00:32:38,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:38,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:38,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1849110990, now seen corresponding path program 1 times [2025-03-04 00:32:38,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:38,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698217467] [2025-03-04 00:32:38,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:38,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:38,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-04 00:32:39,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 00:32:39,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:39,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:40,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:40,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698217467] [2025-03-04 00:32:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698217467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:40,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:40,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416125100] [2025-03-04 00:32:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:40,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:40,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:40,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:40,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:40,690 INFO L87 Difference]: Start difference. First operand 364 states and 591 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:40,864 INFO L93 Difference]: Finished difference Result 957 states and 1549 transitions. [2025-03-04 00:32:40,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-03-04 00:32:40,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:40,873 INFO L225 Difference]: With dead ends: 957 [2025-03-04 00:32:40,873 INFO L226 Difference]: Without dead ends: 596 [2025-03-04 00:32:40,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:40,879 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 527 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:40,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 746 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2025-03-04 00:32:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 386. [2025-03-04 00:32:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 311 states have (on average 1.5337620578778135) internal successors, (477), 313 states have internal predecessors, (477), 71 states have call successors, (71), 3 states have call predecessors, (71), 3 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-04 00:32:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 619 transitions. [2025-03-04 00:32:40,915 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 619 transitions. Word has length 428 [2025-03-04 00:32:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:40,916 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 619 transitions. [2025-03-04 00:32:40,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 4 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:40,916 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 619 transitions. [2025-03-04 00:32:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-03-04 00:32:40,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:40,922 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:40,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:32:40,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:40,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:40,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1828773615, now seen corresponding path program 1 times [2025-03-04 00:32:40,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:40,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202195535] [2025-03-04 00:32:40,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:40,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:40,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-03-04 00:32:42,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-03-04 00:32:42,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:42,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:43,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:43,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202195535] [2025-03-04 00:32:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202195535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:43,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:43,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 00:32:43,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416992778] [2025-03-04 00:32:43,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:43,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 00:32:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:43,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 00:32:43,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 00:32:43,913 INFO L87 Difference]: Start difference. First operand 386 states and 619 transitions. Second operand has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:44,403 INFO L93 Difference]: Finished difference Result 1295 states and 2089 transitions. [2025-03-04 00:32:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 00:32:44,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 428 [2025-03-04 00:32:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:44,412 INFO L225 Difference]: With dead ends: 1295 [2025-03-04 00:32:44,413 INFO L226 Difference]: Without dead ends: 922 [2025-03-04 00:32:44,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:32:44,415 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 449 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1981 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:44,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1981 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 00:32:44,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-03-04 00:32:44,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 757. [2025-03-04 00:32:44,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 614 states have (on average 1.5342019543973942) internal successors, (942), 617 states have internal predecessors, (942), 136 states have call successors, (136), 6 states have call predecessors, (136), 6 states have return successors, (136), 133 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-04 00:32:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1214 transitions. [2025-03-04 00:32:44,486 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1214 transitions. Word has length 428 [2025-03-04 00:32:44,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:44,489 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 1214 transitions. [2025-03-04 00:32:44,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.0) internal successors, (126), 6 states have internal predecessors, (126), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1214 transitions. [2025-03-04 00:32:44,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-03-04 00:32:44,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:44,497 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:44,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:32:44,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:44,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:44,498 INFO L85 PathProgramCache]: Analyzing trace with hash -195660116, now seen corresponding path program 1 times [2025-03-04 00:32:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:44,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862852380] [2025-03-04 00:32:44,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:44,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:44,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-04 00:32:46,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-04 00:32:46,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:46,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 12 proven. 168 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:32:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862852380] [2025-03-04 00:32:46,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862852380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:46,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244178721] [2025-03-04 00:32:46,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:46,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:46,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:46,999 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:32:47,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 00:32:47,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-03-04 00:32:47,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-03-04 00:32:47,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:47,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:47,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:32:47,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:47,596 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 1828 proven. 24 refuted. 0 times theorem prover too weak. 5468 trivial. 0 not checked. [2025-03-04 00:32:47,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:32:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 156 proven. 24 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:32:47,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244178721] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:32:47,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:32:47,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 00:32:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135282358] [2025-03-04 00:32:47,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:32:47,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:32:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:47,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:32:47,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:32:47,957 INFO L87 Difference]: Start difference. First operand 757 states and 1214 transitions. Second operand has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) [2025-03-04 00:32:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:48,603 INFO L93 Difference]: Finished difference Result 1327 states and 2092 transitions. [2025-03-04 00:32:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 00:32:48,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) Word has length 429 [2025-03-04 00:32:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:48,608 INFO L225 Difference]: With dead ends: 1327 [2025-03-04 00:32:48,608 INFO L226 Difference]: Without dead ends: 583 [2025-03-04 00:32:48,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 855 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:32:48,610 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 557 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:48,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 749 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 00:32:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-03-04 00:32:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 515. [2025-03-04 00:32:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 375 states have (on average 1.4213333333333333) internal successors, (533), 376 states have internal predecessors, (533), 128 states have call successors, (128), 11 states have call predecessors, (128), 11 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-04 00:32:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 789 transitions. [2025-03-04 00:32:48,660 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 789 transitions. Word has length 429 [2025-03-04 00:32:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:48,661 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 789 transitions. [2025-03-04 00:32:48,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.0) internal successors, (297), 9 states have internal predecessors, (297), 4 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 4 states have call predecessors, (127), 4 states have call successors, (127) [2025-03-04 00:32:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 789 transitions. [2025-03-04 00:32:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:32:48,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:48,667 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:48,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:32:48,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:48,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:48,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:48,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1492157150, now seen corresponding path program 1 times [2025-03-04 00:32:48,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:48,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104279001] [2025-03-04 00:32:48,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:48,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:48,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:32:49,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:32:49,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:49,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:49,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104279001] [2025-03-04 00:32:49,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104279001] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:49,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:49,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246187667] [2025-03-04 00:32:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:49,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:49,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:49,638 INFO L87 Difference]: Start difference. First operand 515 states and 789 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:49,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:49,747 INFO L93 Difference]: Finished difference Result 1237 states and 1893 transitions. [2025-03-04 00:32:49,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:49,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-03-04 00:32:49,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:49,756 INFO L225 Difference]: With dead ends: 1237 [2025-03-04 00:32:49,756 INFO L226 Difference]: Without dead ends: 739 [2025-03-04 00:32:49,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:49,758 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 206 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:49,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 794 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-04 00:32:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 605. [2025-03-04 00:32:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 465 states have (on average 1.4623655913978495) internal successors, (680), 466 states have internal predecessors, (680), 128 states have call successors, (128), 11 states have call predecessors, (128), 11 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-04 00:32:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 936 transitions. [2025-03-04 00:32:49,806 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 936 transitions. Word has length 430 [2025-03-04 00:32:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:49,807 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 936 transitions. [2025-03-04 00:32:49,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 936 transitions. [2025-03-04 00:32:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:32:49,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:49,811 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:49,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:32:49,811 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:49,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:49,812 INFO L85 PathProgramCache]: Analyzing trace with hash -545899139, now seen corresponding path program 1 times [2025-03-04 00:32:49,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:49,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744490650] [2025-03-04 00:32:49,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:49,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:49,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:32:51,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:32:51,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:32:51,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744490650] [2025-03-04 00:32:51,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744490650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:51,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458052346] [2025-03-04 00:32:51,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:51,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:51,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:51,318 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-04 00:32:51,319 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-04 00:32:51,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:32:51,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:32:51,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:51,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:51,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:32:51,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 1368 proven. 162 refuted. 0 times theorem prover too weak. 5790 trivial. 0 not checked. [2025-03-04 00:32:52,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:32:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:32:52,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458052346] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:32:52,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:32:52,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:32:52,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413299846] [2025-03-04 00:32:52,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:32:52,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:32:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:52,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:32:52,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:32:52,528 INFO L87 Difference]: Start difference. First operand 605 states and 936 transitions. Second operand has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-03-04 00:32:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:52,854 INFO L93 Difference]: Finished difference Result 1117 states and 1715 transitions. [2025-03-04 00:32:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:32:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) Word has length 430 [2025-03-04 00:32:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:52,860 INFO L225 Difference]: With dead ends: 1117 [2025-03-04 00:32:52,860 INFO L226 Difference]: Without dead ends: 525 [2025-03-04 00:32:52,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:32:52,863 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 377 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:52,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 750 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 00:32:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-03-04 00:32:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 515. [2025-03-04 00:32:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 515 states, 373 states have (on average 1.4128686327077749) internal successors, (527), 374 states have internal predecessors, (527), 128 states have call successors, (128), 13 states have call predecessors, (128), 13 states have return successors, (128), 127 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-04 00:32:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 783 transitions. [2025-03-04 00:32:52,898 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 783 transitions. Word has length 430 [2025-03-04 00:32:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:52,899 INFO L471 AbstractCegarLoop]: Abstraction has 515 states and 783 transitions. [2025-03-04 00:32:52,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.571428571428573) internal successors, (137), 7 states have internal predecessors, (137), 2 states have call successors, (115), 2 states have call predecessors, (115), 4 states have return successors, (116), 2 states have call predecessors, (116), 2 states have call successors, (116) [2025-03-04 00:32:52,899 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 783 transitions. [2025-03-04 00:32:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:32:52,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:52,901 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:52,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 00:32:53,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:53,106 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:53,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:53,107 INFO L85 PathProgramCache]: Analyzing trace with hash -771279074, now seen corresponding path program 1 times [2025-03-04 00:32:53,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:53,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020920744] [2025-03-04 00:32:53,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:53,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:53,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:32:53,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:32:53,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:53,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:53,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:53,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020920744] [2025-03-04 00:32:53,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020920744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:53,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:53,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:32:53,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962753601] [2025-03-04 00:32:53,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:53,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:32:53,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:53,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:32:53,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:53,232 INFO L87 Difference]: Start difference. First operand 515 states and 783 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:53,298 INFO L93 Difference]: Finished difference Result 1144 states and 1748 transitions. [2025-03-04 00:32:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:32:53,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-03-04 00:32:53,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:53,305 INFO L225 Difference]: With dead ends: 1144 [2025-03-04 00:32:53,305 INFO L226 Difference]: Without dead ends: 646 [2025-03-04 00:32:53,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:32:53,307 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 358 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:53,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 793 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:32:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-03-04 00:32:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 615. [2025-03-04 00:32:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 415 states have (on average 1.3662650602409638) internal successors, (567), 416 states have internal predecessors, (567), 183 states have call successors, (183), 16 states have call predecessors, (183), 16 states have return successors, (183), 182 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-04 00:32:53,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 933 transitions. [2025-03-04 00:32:53,348 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 933 transitions. Word has length 430 [2025-03-04 00:32:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:53,349 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 933 transitions. [2025-03-04 00:32:53,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 933 transitions. [2025-03-04 00:32:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:32:53,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:53,352 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:53,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:32:53,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -750941699, now seen corresponding path program 1 times [2025-03-04 00:32:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686083235] [2025-03-04 00:32:53,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:53,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:32:53,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:32:53,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:53,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:54,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:32:54,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:54,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686083235] [2025-03-04 00:32:54,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686083235] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:32:54,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:32:54,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:32:54,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855532268] [2025-03-04 00:32:54,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:32:54,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:32:54,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:54,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:32:54,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:32:54,113 INFO L87 Difference]: Start difference. First operand 615 states and 933 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:54,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:54,262 INFO L93 Difference]: Finished difference Result 1237 states and 1859 transitions. [2025-03-04 00:32:54,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:32:54,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-03-04 00:32:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:54,267 INFO L225 Difference]: With dead ends: 1237 [2025-03-04 00:32:54,268 INFO L226 Difference]: Without dead ends: 739 [2025-03-04 00:32:54,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 00:32:54,269 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 246 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:54,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 882 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:32:54,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2025-03-04 00:32:54,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 526. [2025-03-04 00:32:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 385 states have (on average 1.4077922077922078) internal successors, (542), 386 states have internal predecessors, (542), 127 states have call successors, (127), 13 states have call predecessors, (127), 13 states have return successors, (127), 126 states have call predecessors, (127), 127 states have call successors, (127) [2025-03-04 00:32:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 796 transitions. [2025-03-04 00:32:54,303 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 796 transitions. Word has length 430 [2025-03-04 00:32:54,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:54,303 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 796 transitions. [2025-03-04 00:32:54,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:32:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 796 transitions. [2025-03-04 00:32:54,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-03-04 00:32:54,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:54,305 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:54,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:32:54,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1748014052, now seen corresponding path program 1 times [2025-03-04 00:32:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624024054] [2025-03-04 00:32:54,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:54,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:54,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:32:55,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:32:55,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:55,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:32:56,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:32:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624024054] [2025-03-04 00:32:56,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624024054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:32:56,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545331281] [2025-03-04 00:32:56,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:56,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:56,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:32:56,366 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:32:56,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 00:32:56,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-03-04 00:32:56,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-03-04 00:32:56,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:32:56,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:32:56,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 00:32:56,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:32:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3168 proven. 54 refuted. 0 times theorem prover too weak. 4098 trivial. 0 not checked. [2025-03-04 00:32:57,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:32:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 126 proven. 54 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:32:57,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545331281] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:32:57,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:32:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 16 [2025-03-04 00:32:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739778395] [2025-03-04 00:32:57,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:32:57,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 00:32:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:32:57,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 00:32:57,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-03-04 00:32:57,842 INFO L87 Difference]: Start difference. First operand 526 states and 796 transitions. Second operand has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 6 states have call successors, (183), 3 states have call predecessors, (183), 6 states have return successors, (183), 6 states have call predecessors, (183), 6 states have call successors, (183) [2025-03-04 00:32:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:32:59,176 INFO L93 Difference]: Finished difference Result 1662 states and 2544 transitions. [2025-03-04 00:32:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 00:32:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 6 states have call successors, (183), 3 states have call predecessors, (183), 6 states have return successors, (183), 6 states have call predecessors, (183), 6 states have call successors, (183) Word has length 430 [2025-03-04 00:32:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:32:59,184 INFO L225 Difference]: With dead ends: 1662 [2025-03-04 00:32:59,184 INFO L226 Difference]: Without dead ends: 1152 [2025-03-04 00:32:59,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=426, Unknown=0, NotChecked=0, Total=600 [2025-03-04 00:32:59,187 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 832 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:32:59,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 2793 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 00:32:59,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2025-03-04 00:32:59,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 708. [2025-03-04 00:32:59,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 506 states have (on average 1.391304347826087) internal successors, (704), 506 states have internal predecessors, (704), 183 states have call successors, (183), 18 states have call predecessors, (183), 18 states have return successors, (183), 183 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-04 00:32:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1070 transitions. [2025-03-04 00:32:59,277 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1070 transitions. Word has length 430 [2025-03-04 00:32:59,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:32:59,278 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1070 transitions. [2025-03-04 00:32:59,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.75) internal successors, (316), 16 states have internal predecessors, (316), 6 states have call successors, (183), 3 states have call predecessors, (183), 6 states have return successors, (183), 6 states have call predecessors, (183), 6 states have call successors, (183) [2025-03-04 00:32:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1070 transitions. [2025-03-04 00:32:59,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-04 00:32:59,280 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:32:59,280 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:32:59,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 00:32:59,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:32:59,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:32:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:32:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1877922523, now seen corresponding path program 1 times [2025-03-04 00:32:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:32:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352315225] [2025-03-04 00:32:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:32:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:32:59,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:00,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:00,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:00,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:01,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352315225] [2025-03-04 00:33:01,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352315225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:01,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943097875] [2025-03-04 00:33:01,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:01,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:01,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:01,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:01,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 00:33:02,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:02,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:02,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:02,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:02,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 00:33:02,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:02,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:33:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943097875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:02,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:33:02,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2025-03-04 00:33:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891153867] [2025-03-04 00:33:02,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:02,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:33:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:02,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:33:02,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-04 00:33:02,936 INFO L87 Difference]: Start difference. First operand 708 states and 1070 transitions. Second operand has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:06,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-04 00:33:07,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:07,907 INFO L93 Difference]: Finished difference Result 1992 states and 3037 transitions. [2025-03-04 00:33:07,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:33:07,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 431 [2025-03-04 00:33:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:07,917 INFO L225 Difference]: With dead ends: 1992 [2025-03-04 00:33:07,917 INFO L226 Difference]: Without dead ends: 1736 [2025-03-04 00:33:07,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-04 00:33:07,920 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 775 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:07,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 2207 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-03-04 00:33:07,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2025-03-04 00:33:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 760. [2025-03-04 00:33:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 558 states have (on average 1.403225806451613) internal successors, (783), 558 states have internal predecessors, (783), 183 states have call successors, (183), 18 states have call predecessors, (183), 18 states have return successors, (183), 183 states have call predecessors, (183), 183 states have call successors, (183) [2025-03-04 00:33:08,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1149 transitions. [2025-03-04 00:33:08,001 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1149 transitions. Word has length 431 [2025-03-04 00:33:08,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:08,002 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1149 transitions. [2025-03-04 00:33:08,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.428571428571427) internal successors, (129), 7 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-03-04 00:33:08,002 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1149 transitions. [2025-03-04 00:33:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-03-04 00:33:08,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:08,004 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:08,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 00:33:08,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 00:33:08,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:08,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:08,205 INFO L85 PathProgramCache]: Analyzing trace with hash 694575226, now seen corresponding path program 1 times [2025-03-04 00:33:08,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:08,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375148221] [2025-03-04 00:33:08,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:08,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:08,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:09,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:09,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:09,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:09,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375148221] [2025-03-04 00:33:09,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375148221] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:09,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431434524] [2025-03-04 00:33:09,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:09,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:09,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:09,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:09,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 00:33:10,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-03-04 00:33:10,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-03-04 00:33:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:10,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 00:33:10,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:33:11,074 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3340 proven. 60 refuted. 0 times theorem prover too weak. 3920 trivial. 0 not checked. [2025-03-04 00:33:11,075 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:33:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 60 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-03-04 00:33:11,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431434524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:33:11,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:33:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 10] total 24 [2025-03-04 00:33:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336234311] [2025-03-04 00:33:11,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:33:11,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 00:33:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:11,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 00:33:11,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2025-03-04 00:33:11,661 INFO L87 Difference]: Start difference. First operand 760 states and 1149 transitions. Second operand has 24 states, 24 states have (on average 13.083333333333334) internal successors, (314), 24 states have internal predecessors, (314), 5 states have call successors, (142), 3 states have call predecessors, (142), 6 states have return successors, (143), 5 states have call predecessors, (143), 5 states have call successors, (143) [2025-03-04 00:33:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:13,697 INFO L93 Difference]: Finished difference Result 2129 states and 3191 transitions. [2025-03-04 00:33:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 00:33:13,698 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 13.083333333333334) internal successors, (314), 24 states have internal predecessors, (314), 5 states have call successors, (142), 3 states have call predecessors, (142), 6 states have return successors, (143), 5 states have call predecessors, (143), 5 states have call successors, (143) Word has length 431 [2025-03-04 00:33:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:13,704 INFO L225 Difference]: With dead ends: 2129 [2025-03-04 00:33:13,704 INFO L226 Difference]: Without dead ends: 1506 [2025-03-04 00:33:13,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 850 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=791, Invalid=2869, Unknown=0, NotChecked=0, Total=3660 [2025-03-04 00:33:13,707 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 3363 mSDsluCounter, 2085 mSDsCounter, 0 mSdLazyCounter, 1814 mSolverCounterSat, 1343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3365 SdHoareTripleChecker+Valid, 2422 SdHoareTripleChecker+Invalid, 3157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1343 IncrementalHoareTripleChecker+Valid, 1814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:13,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3365 Valid, 2422 Invalid, 3157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1343 Valid, 1814 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 00:33:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-04 00:33:13,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1318. [2025-03-04 00:33:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 973 states have (on average 1.3864337101747173) internal successors, (1349), 973 states have internal predecessors, (1349), 305 states have call successors, (305), 39 states have call predecessors, (305), 39 states have return successors, (305), 305 states have call predecessors, (305), 305 states have call successors, (305) [2025-03-04 00:33:13,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1959 transitions. [2025-03-04 00:33:13,810 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1959 transitions. Word has length 431 [2025-03-04 00:33:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:13,811 INFO L471 AbstractCegarLoop]: Abstraction has 1318 states and 1959 transitions. [2025-03-04 00:33:13,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 13.083333333333334) internal successors, (314), 24 states have internal predecessors, (314), 5 states have call successors, (142), 3 states have call predecessors, (142), 6 states have return successors, (143), 5 states have call predecessors, (143), 5 states have call successors, (143) [2025-03-04 00:33:13,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1959 transitions. [2025-03-04 00:33:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-04 00:33:13,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:13,815 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:13,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 00:33:14,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:14,016 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:14,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash 762826095, now seen corresponding path program 1 times [2025-03-04 00:33:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:14,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371573640] [2025-03-04 00:33:14,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:14,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-04 00:33:14,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-04 00:33:14,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:14,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:17,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:17,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371573640] [2025-03-04 00:33:17,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371573640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:17,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:17,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-03-04 00:33:17,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729172336] [2025-03-04 00:33:17,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:17,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 00:33:17,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:17,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 00:33:17,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-04 00:33:17,951 INFO L87 Difference]: Start difference. First operand 1318 states and 1959 transitions. Second operand has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 4 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 4 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-04 00:33:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:24,409 INFO L93 Difference]: Finished difference Result 4443 states and 6590 transitions. [2025-03-04 00:33:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 00:33:24,409 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 4 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 4 states have call predecessors, (61), 4 states have call successors, (61) Word has length 432 [2025-03-04 00:33:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:24,420 INFO L225 Difference]: With dead ends: 4443 [2025-03-04 00:33:24,420 INFO L226 Difference]: Without dead ends: 3345 [2025-03-04 00:33:24,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=613, Invalid=1549, Unknown=0, NotChecked=0, Total=2162 [2025-03-04 00:33:24,424 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 4296 mSDsluCounter, 3193 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 1301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4296 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1301 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:24,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 3520 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1301 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-04 00:33:24,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2025-03-04 00:33:24,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 1566. [2025-03-04 00:33:24,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1221 states have (on average 1.425061425061425) internal successors, (1740), 1221 states have internal predecessors, (1740), 305 states have call successors, (305), 39 states have call predecessors, (305), 39 states have return successors, (305), 305 states have call predecessors, (305), 305 states have call successors, (305) [2025-03-04 00:33:24,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2350 transitions. [2025-03-04 00:33:24,571 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2350 transitions. Word has length 432 [2025-03-04 00:33:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:24,572 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2350 transitions. [2025-03-04 00:33:24,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.842105263157895) internal successors, (130), 19 states have internal predecessors, (130), 4 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 4 states have call predecessors, (61), 4 states have call successors, (61) [2025-03-04 00:33:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2350 transitions. [2025-03-04 00:33:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-04 00:33:24,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:24,575 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:24,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:33:24,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:24,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:24,576 INFO L85 PathProgramCache]: Analyzing trace with hash 279150768, now seen corresponding path program 1 times [2025-03-04 00:33:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068606750] [2025-03-04 00:33:24,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:24,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-04 00:33:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-04 00:33:25,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:25,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-03-04 00:33:26,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:26,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068606750] [2025-03-04 00:33:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068606750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:33:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:33:26,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 00:33:26,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757507915] [2025-03-04 00:33:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:33:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 00:33:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:33:26,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 00:33:26,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:33:26,293 INFO L87 Difference]: Start difference. First operand 1566 states and 2350 transitions. Second operand has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:33:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:33:27,717 INFO L93 Difference]: Finished difference Result 4471 states and 6661 transitions. [2025-03-04 00:33:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 00:33:27,717 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 432 [2025-03-04 00:33:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:33:27,731 INFO L225 Difference]: With dead ends: 4471 [2025-03-04 00:33:27,732 INFO L226 Difference]: Without dead ends: 3373 [2025-03-04 00:33:27,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2025-03-04 00:33:27,736 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 935 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 2918 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:33:27,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 2918 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 00:33:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2025-03-04 00:33:28,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3031. [2025-03-04 00:33:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 2416 states have (on average 1.4325331125827814) internal successors, (3461), 2420 states have internal predecessors, (3461), 539 states have call successors, (539), 75 states have call predecessors, (539), 75 states have return successors, (539), 535 states have call predecessors, (539), 539 states have call successors, (539) [2025-03-04 00:33:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 4539 transitions. [2025-03-04 00:33:28,060 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 4539 transitions. Word has length 432 [2025-03-04 00:33:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:33:28,060 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 4539 transitions. [2025-03-04 00:33:28,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.444444444444445) internal successors, (130), 9 states have internal predecessors, (130), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-03-04 00:33:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 4539 transitions. [2025-03-04 00:33:28,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-04 00:33:28,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:33:28,067 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 00:33:28,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:33:28,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:33:28,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:33:28,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1129728612, now seen corresponding path program 1 times [2025-03-04 00:33:28,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:33:28,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853815883] [2025-03-04 00:33:28,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:28,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:33:28,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-04 00:33:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-04 00:33:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 267 proven. 255 refuted. 0 times theorem prover too weak. 6798 trivial. 0 not checked. [2025-03-04 00:33:36,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:33:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853815883] [2025-03-04 00:33:36,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853815883] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:33:36,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786669496] [2025-03-04 00:33:36,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:33:36,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:33:36,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:33:36,459 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 00:33:36,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 00:33:36,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-04 00:33:36,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-04 00:33:36,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:33:36,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:33:36,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 00:33:36,916 INFO L279 TraceCheckSpWp]: Computing forward predicates...