./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/bAnd5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/array-crafted/bAnd5.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 d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:39:07,265 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:39:07,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:39:07,314 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:39:07,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:39:07,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:39:07,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:39:07,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:39:07,343 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:39:07,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:39:07,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:39:07,343 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:39:07,343 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:39:07,344 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:39:07,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:39:07,344 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:39:07,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:39:07,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:39:07,345 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 -> d475be4701a825f0568ebf884900dce77e1216a215283bc51d05a41cc9a8ddb5 [2025-03-16 13:39:07,594 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:39:07,603 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:39:07,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:39:07,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:39:07,607 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:39:07,608 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/bAnd5.i [2025-03-16 13:39:08,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05bebb6e4/1025dedfa35d4dd6b3f21da6fbd9aa37/FLAG2c0a0fc55 [2025-03-16 13:39:08,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:39:08,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/bAnd5.i [2025-03-16 13:39:08,922 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05bebb6e4/1025dedfa35d4dd6b3f21da6fbd9aa37/FLAG2c0a0fc55 [2025-03-16 13:39:09,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05bebb6e4/1025dedfa35d4dd6b3f21da6fbd9aa37 [2025-03-16 13:39:09,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:39:09,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:39:09,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:39:09,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:39:09,278 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:39:09,279 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cee2db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09, skipping insertion in model container [2025-03-16 13:39:09,280 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,289 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:39:09,397 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/array-crafted/bAnd5.i[1369,1382] [2025-03-16 13:39:09,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:39:09,410 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:39:09,426 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/array-crafted/bAnd5.i[1369,1382] [2025-03-16 13:39:09,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:39:09,439 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:39:09,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09 WrapperNode [2025-03-16 13:39:09,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:39:09,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:39:09,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:39:09,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:39:09,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,467 INFO L138 Inliner]: procedures = 16, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 76 [2025-03-16 13:39:09,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:39:09,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:39:09,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:39:09,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:39:09,474 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,491 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 8, 11]. 52 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 5 writes are split as follows [0, 0, 5]. [2025-03-16 13:39:09,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,501 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,505 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:39:09,508 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:39:09,508 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:39:09,508 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:39:09,508 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (1/1) ... [2025-03-16 13:39:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:39:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:39:09,539 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-16 13:39:09,543 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-16 13:39:09,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure bAnd [2025-03-16 13:39:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure bAnd [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:39:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:39:09,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:39:09,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:39:09,608 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:39:09,610 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:39:09,725 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-16 13:39:09,725 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:39:09,737 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:39:09,738 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:39:09,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:39:09 BoogieIcfgContainer [2025-03-16 13:39:09,738 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:39:09,742 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:39:09,742 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:39:09,745 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:39:09,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:39:09" (1/3) ... [2025-03-16 13:39:09,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c2753e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:39:09, skipping insertion in model container [2025-03-16 13:39:09,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:39:09" (2/3) ... [2025-03-16 13:39:09,746 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c2753e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:39:09, skipping insertion in model container [2025-03-16 13:39:09,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:39:09" (3/3) ... [2025-03-16 13:39:09,748 INFO L128 eAbstractionObserver]: Analyzing ICFG bAnd5.i [2025-03-16 13:39:09,757 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:39:09,758 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bAnd5.i that has 2 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:39:09,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:39:09,798 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;@6c0b3abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:39:09,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:39:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:39:09,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 13:39:09,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:39:09,805 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:39:09,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:39:09,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:39:09,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1131066325, now seen corresponding path program 1 times [2025-03-16 13:39:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:39:09,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372483715] [2025-03-16 13:39:09,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:39:09,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 13:39:09,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 13:39:09,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:09,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:10,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:39:10,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:39:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372483715] [2025-03-16 13:39:10,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372483715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:39:10,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:39:10,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 13:39:10,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737447160] [2025-03-16 13:39:10,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:39:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:39:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:39:10,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:39:10,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:39:10,072 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:39:10,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:39:10,109 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2025-03-16 13:39:10,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:39:10,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-03-16 13:39:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:39:10,115 INFO L225 Difference]: With dead ends: 48 [2025-03-16 13:39:10,115 INFO L226 Difference]: Without dead ends: 22 [2025-03-16 13:39:10,116 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-16 13:39:10,118 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:39:10,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:39:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-16 13:39:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-16 13:39:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:39:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-16 13:39:10,139 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 24 [2025-03-16 13:39:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:39:10,139 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-16 13:39:10,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-16 13:39:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-16 13:39:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 13:39:10,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:39:10,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:39:10,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:39:10,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:39:10,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:39:10,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2019015697, now seen corresponding path program 1 times [2025-03-16 13:39:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:39:10,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919857440] [2025-03-16 13:39:10,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:39:10,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 13:39:10,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 13:39:10,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:10,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:39:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:39:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919857440] [2025-03-16 13:39:10,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919857440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:39:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662809389] [2025-03-16 13:39:10,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:39:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:39:10,284 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-16 13:39:10,285 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-16 13:39:10,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 13:39:10,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 13:39:10,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:10,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:10,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:39:10,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:39:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:39:10,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:39:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:39:10,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662809389] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:39:10,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:39:10,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-16 13:39:10,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197939065] [2025-03-16 13:39:10,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:39:10,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 13:39:10,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:39:10,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 13:39:10,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 13:39:10,477 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:39:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:39:10,549 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2025-03-16 13:39:10,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:39:10,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 25 [2025-03-16 13:39:10,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:39:10,550 INFO L225 Difference]: With dead ends: 46 [2025-03-16 13:39:10,550 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 13:39:10,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-16 13:39:10,551 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:39:10,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 92 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:39:10,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 13:39:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-03-16 13:39:10,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:39:10,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-16 13:39:10,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 25 [2025-03-16 13:39:10,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:39:10,555 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-16 13:39:10,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:39:10,555 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-16 13:39:10,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 13:39:10,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:39:10,556 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:39:10,562 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-16 13:39:10,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:39:10,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:39:10,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:39:10,757 INFO L85 PathProgramCache]: Analyzing trace with hash 240769340, now seen corresponding path program 1 times [2025-03-16 13:39:10,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:39:10,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179864059] [2025-03-16 13:39:10,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:10,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:39:10,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 13:39:10,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 13:39:10,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:10,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-16 13:39:10,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:39:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179864059] [2025-03-16 13:39:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179864059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:39:10,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:39:10,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:39:10,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874345004] [2025-03-16 13:39:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:39:10,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:39:10,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:39:10,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:39:10,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:39:10,874 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:39:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:39:10,904 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-03-16 13:39:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:39:10,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-03-16 13:39:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:39:10,905 INFO L225 Difference]: With dead ends: 39 [2025-03-16 13:39:10,905 INFO L226 Difference]: Without dead ends: 25 [2025-03-16 13:39:10,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-16 13:39:10,905 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:39:10,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 31 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:39:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-16 13:39:10,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-16 13:39:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:39:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-03-16 13:39:10,912 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 35 [2025-03-16 13:39:10,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:39:10,913 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-03-16 13:39:10,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:39:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-03-16 13:39:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 13:39:10,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:39:10,914 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:39:10,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 13:39:10,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:39:10,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:39:10,915 INFO L85 PathProgramCache]: Analyzing trace with hash 321110560, now seen corresponding path program 1 times [2025-03-16 13:39:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:39:10,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868388021] [2025-03-16 13:39:10,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:39:10,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:39:10,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:39:10,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:10,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 13:39:11,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:39:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868388021] [2025-03-16 13:39:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868388021] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:39:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944753311] [2025-03-16 13:39:11,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:11,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:39:11,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:39:11,483 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-16 13:39:11,483 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-16 13:39:11,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 13:39:11,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 13:39:11,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:11,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:11,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 13:39:11,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:39:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-16 13:39:11,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:39:11,931 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-16 13:39:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944753311] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:39:11,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:39:11,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 17 [2025-03-16 13:39:11,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486241806] [2025-03-16 13:39:11,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:39:11,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 13:39:11,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:39:11,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 13:39:11,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-16 13:39:11,934 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 17 states, 16 states have (on average 1.5625) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 13:39:12,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:39:12,020 INFO L93 Difference]: Finished difference Result 65 states and 93 transitions. [2025-03-16 13:39:12,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 13:39:12,021 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2025-03-16 13:39:12,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:39:12,023 INFO L225 Difference]: With dead ends: 65 [2025-03-16 13:39:12,023 INFO L226 Difference]: Without dead ends: 44 [2025-03-16 13:39:12,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-16 13:39:12,023 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:39:12,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 250 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:39:12,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-16 13:39:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2025-03-16 13:39:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-16 13:39:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2025-03-16 13:39:12,036 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 36 [2025-03-16 13:39:12,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:39:12,036 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2025-03-16 13:39:12,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.5625) internal successors, (25), 12 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 13:39:12,037 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2025-03-16 13:39:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:39:12,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:39:12,038 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:39:12,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 13:39:12,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-16 13:39:12,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:39:12,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:39:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash 689151960, now seen corresponding path program 1 times [2025-03-16 13:39:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:39:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836416777] [2025-03-16 13:39:12,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:39:12,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:39:12,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:39:12,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:12,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:39:13,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:39:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836416777] [2025-03-16 13:39:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836416777] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:39:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921089267] [2025-03-16 13:39:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:39:13,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:39:13,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:39:13,321 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-16 13:39:13,322 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-16 13:39:13,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 13:39:13,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:39:13,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:39:13,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:13,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-16 13:39:13,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:39:13,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:39:13,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:39:13,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:39:13,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2025-03-16 13:39:13,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:39:13,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2025-03-16 13:39:13,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:39:13,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2025-03-16 13:39:14,273 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 13:39:14,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:39:15,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 236 [2025-03-16 13:39:15,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:39:15,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 392 treesize of output 378 [2025-03-16 13:39:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 13:39:15,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921089267] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:39:15,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:39:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 18] total 57 [2025-03-16 13:39:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248179963] [2025-03-16 13:39:15,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:39:15,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-16 13:39:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:39:15,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-16 13:39:15,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=2876, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 13:39:15,255 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 57 states, 51 states have (on average 1.588235294117647) internal successors, (81), 52 states have internal predecessors, (81), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-16 13:39:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:39:17,512 INFO L93 Difference]: Finished difference Result 203 states and 301 transitions. [2025-03-16 13:39:17,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 13:39:17,513 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 51 states have (on average 1.588235294117647) internal successors, (81), 52 states have internal predecessors, (81), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) Word has length 37 [2025-03-16 13:39:17,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:39:17,515 INFO L225 Difference]: With dead ends: 203 [2025-03-16 13:39:17,515 INFO L226 Difference]: Without dead ends: 171 [2025-03-16 13:39:17,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=889, Invalid=7301, Unknown=0, NotChecked=0, Total=8190 [2025-03-16 13:39:17,519 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 287 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 13:39:17,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 427 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 13:39:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-03-16 13:39:17,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 131. [2025-03-16 13:39:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 111 states have internal predecessors, (136), 16 states have call successors, (16), 4 states have call predecessors, (16), 11 states have return successors, (55), 15 states have call predecessors, (55), 16 states have call successors, (55) [2025-03-16 13:39:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 207 transitions. [2025-03-16 13:39:17,550 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 207 transitions. Word has length 37 [2025-03-16 13:39:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:39:17,550 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 207 transitions. [2025-03-16 13:39:17,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 51 states have (on average 1.588235294117647) internal successors, (81), 52 states have internal predecessors, (81), 8 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 8 states have call successors, (9) [2025-03-16 13:39:17,551 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 207 transitions. [2025-03-16 13:39:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:39:17,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:39:17,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:39:17,560 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-16 13:39:17,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:39:17,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:39:17,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:39:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash -961203274, now seen corresponding path program 2 times [2025-03-16 13:39:17,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:39:17,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219389753] [2025-03-16 13:39:17,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:39:17,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:39:17,770 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 13:39:17,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:39:17,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:39:17,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 13:39:18,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:39:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219389753] [2025-03-16 13:39:18,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219389753] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:39:18,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917009030] [2025-03-16 13:39:18,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:39:18,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:39:18,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:39:18,452 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-16 13:39:18,453 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-16 13:39:18,484 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 13:39:18,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:39:18,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:39:18,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:39:18,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 73 conjuncts are in the unsatisfiable core [2025-03-16 13:39:18,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:39:18,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-16 13:39:18,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:39:18,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2025-03-16 13:39:18,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:39:18,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 25 [2025-03-16 13:39:18,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:39:18,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 22 [2025-03-16 13:39:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 13:39:19,112 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:39:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:39:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917009030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:39:35,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:39:35,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 14] total 48 [2025-03-16 13:39:35,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305558495] [2025-03-16 13:39:35,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:39:35,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-16 13:39:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:39:35,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-16 13:39:35,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2034, Unknown=4, NotChecked=0, Total=2256 [2025-03-16 13:39:35,645 INFO L87 Difference]: Start difference. First operand 131 states and 207 transitions. Second operand has 48 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 45 states have internal predecessors, (79), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 13:39:39,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:39:43,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:39:47,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:39:51,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:39:56,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:00,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:04,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:08,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:17,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:21,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:25,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:29,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:33,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:37,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:41,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:45,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:49,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-16 13:40:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:40:49,403 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2025-03-16 13:40:49,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-16 13:40:49,403 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 45 states have internal predecessors, (79), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) Word has length 37 [2025-03-16 13:40:49,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:40:49,406 INFO L225 Difference]: With dead ends: 305 [2025-03-16 13:40:49,407 INFO L226 Difference]: Without dead ends: 188 [2025-03-16 13:40:49,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2357 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=916, Invalid=6911, Unknown=5, NotChecked=0, Total=7832 [2025-03-16 13:40:49,411 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 273 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 100 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.7s IncrementalHoareTripleChecker+Time [2025-03-16 13:40:49,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 404 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1163 Invalid, 17 Unknown, 0 Unchecked, 68.7s Time] [2025-03-16 13:40:49,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-16 13:40:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157. [2025-03-16 13:40:49,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 136 states have internal predecessors, (165), 19 states have call successors, (19), 5 states have call predecessors, (19), 13 states have return successors, (53), 15 states have call predecessors, (53), 19 states have call successors, (53) [2025-03-16 13:40:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 237 transitions. [2025-03-16 13:40:49,435 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 237 transitions. Word has length 37 [2025-03-16 13:40:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:40:49,435 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 237 transitions. [2025-03-16 13:40:49,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 1.7954545454545454) internal successors, (79), 45 states have internal predecessors, (79), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (9), 5 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-16 13:40:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 237 transitions. [2025-03-16 13:40:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 13:40:49,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:40:49,438 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:40:49,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 13:40:49,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:40:49,643 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:40:49,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:40:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash -74524388, now seen corresponding path program 3 times [2025-03-16 13:40:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:40:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608307494] [2025-03-16 13:40:49,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:40:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:40:49,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-16 13:40:49,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 38 statements. [2025-03-16 13:40:49,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:40:49,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:40:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:40:49,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:40:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608307494] [2025-03-16 13:40:49,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608307494] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:40:49,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241243527] [2025-03-16 13:40:49,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:40:49,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:40:49,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:40:49,732 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-16 13:40:49,734 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-16 13:40:49,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-16 13:40:49,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 38 statements. [2025-03-16 13:40:49,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:40:49,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:40:49,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 13:40:49,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:40:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:40:49,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:40:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 13:40:49,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241243527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:40:49,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:40:49,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 14 [2025-03-16 13:40:49,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327999233] [2025-03-16 13:40:49,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:40:49,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:40:49,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:40:49,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:40:49,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:40:49,937 INFO L87 Difference]: Start difference. First operand 157 states and 237 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:40:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:40:50,106 INFO L93 Difference]: Finished difference Result 354 states and 540 transitions. [2025-03-16 13:40:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:40:50,108 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2025-03-16 13:40:50,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:40:50,110 INFO L225 Difference]: With dead ends: 354 [2025-03-16 13:40:50,110 INFO L226 Difference]: Without dead ends: 283 [2025-03-16 13:40:50,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2025-03-16 13:40:50,111 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:40:50,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 250 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:40:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-16 13:40:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 236. [2025-03-16 13:40:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 192 states have (on average 1.3125) internal successors, (252), 208 states have internal predecessors, (252), 24 states have call successors, (24), 8 states have call predecessors, (24), 19 states have return successors, (79), 19 states have call predecessors, (79), 24 states have call successors, (79) [2025-03-16 13:40:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 355 transitions. [2025-03-16 13:40:50,155 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 355 transitions. Word has length 38 [2025-03-16 13:40:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:40:50,155 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 355 transitions. [2025-03-16 13:40:50,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-16 13:40:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 355 transitions. [2025-03-16 13:40:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-16 13:40:50,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:40:50,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:40:50,164 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-16 13:40:50,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:40:50,362 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:40:50,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:40:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1533991140, now seen corresponding path program 1 times [2025-03-16 13:40:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:40:50,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957133060] [2025-03-16 13:40:50,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:40:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:40:50,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 13:40:50,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 13:40:50,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:40:50,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:40:52,330 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 13:40:52,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:40:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957133060] [2025-03-16 13:40:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957133060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:40:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80418950] [2025-03-16 13:40:52,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:40:52,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:40:52,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:40:52,333 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-16 13:40:52,335 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-16 13:40:52,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-16 13:40:52,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-16 13:40:52,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:40:52,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:40:52,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 86 conjuncts are in the unsatisfiable core