./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c --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/loops-crafted-1/mono-crafted_1.c -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 00e8f12f1d0e3d2fc679744754ceeef2daa37b874cd8db07b5ab8c35684165c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 17:55:56,598 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 17:55:56,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 17:55:56,650 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 17:55:56,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 17:55:56,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 17:55:56,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 17:55:56,668 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 17:55:56,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 17:55:56,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 17:55:56,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 17:55:56,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 17:55:56,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 17:55:56,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 17:55:56,673 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 17:55:56,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 17:55:56,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 17:55:56,674 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 17:55:56,674 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 17:55:56,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 17:55:56,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 17:55:56,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 17:55:56,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 17:55:56,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 17:55:56,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 17:55:56,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 17:55:56,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 17:55:56,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 17:55:56,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 17:55:56,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:55:56,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 17:55:56,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 17:55:56,678 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 -> 00e8f12f1d0e3d2fc679744754ceeef2daa37b874cd8db07b5ab8c35684165c0 [2025-03-16 17:55:56,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 17:55:56,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 17:55:56,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 17:55:56,882 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 17:55:56,882 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 17:55:56,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c [2025-03-16 17:55:57,999 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457fe809e/19f9d6491df24e00a76f8521445845f5/FLAG660eb4e8e [2025-03-16 17:55:58,207 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 17:55:58,208 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_1.c [2025-03-16 17:55:58,215 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457fe809e/19f9d6491df24e00a76f8521445845f5/FLAG660eb4e8e [2025-03-16 17:55:58,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/457fe809e/19f9d6491df24e00a76f8521445845f5 [2025-03-16 17:55:58,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 17:55:58,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 17:55:58,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 17:55:58,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 17:55:58,239 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 17:55:58,239 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,241 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f2b0628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58, skipping insertion in model container [2025-03-16 17:55:58,242 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,250 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 17:55:58,344 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/loops-crafted-1/mono-crafted_1.c[318,331] [2025-03-16 17:55:58,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:55:58,362 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 17:55:58,369 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/loops-crafted-1/mono-crafted_1.c[318,331] [2025-03-16 17:55:58,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 17:55:58,379 INFO L204 MainTranslator]: Completed translation [2025-03-16 17:55:58,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58 WrapperNode [2025-03-16 17:55:58,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 17:55:58,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 17:55:58,381 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 17:55:58,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 17:55:58,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,389 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,399 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2025-03-16 17:55:58,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 17:55:58,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 17:55:58,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 17:55:58,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 17:55:58,405 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,412 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 17:55:58,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 17:55:58,418 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 17:55:58,418 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 17:55:58,418 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 17:55:58,419 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (1/1) ... [2025-03-16 17:55:58,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 17:55:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:55:58,443 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 17:55:58,444 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 17:55:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 17:55:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 17:55:58,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 17:55:58,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 17:55:58,493 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 17:55:58,495 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 17:55:58,570 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-16 17:55:58,570 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 17:55:58,576 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 17:55:58,576 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 17:55:58,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:55:58 BoogieIcfgContainer [2025-03-16 17:55:58,577 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 17:55:58,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 17:55:58,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 17:55:58,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 17:55:58,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 05:55:58" (1/3) ... [2025-03-16 17:55:58,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216f21cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:55:58, skipping insertion in model container [2025-03-16 17:55:58,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 05:55:58" (2/3) ... [2025-03-16 17:55:58,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@216f21cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 05:55:58, skipping insertion in model container [2025-03-16 17:55:58,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 05:55:58" (3/3) ... [2025-03-16 17:55:58,583 INFO L128 eAbstractionObserver]: Analyzing ICFG mono-crafted_1.c [2025-03-16 17:55:58,593 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 17:55:58,594 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mono-crafted_1.c that has 1 procedures, 10 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-16 17:55:58,632 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 17:55:58,640 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;@4cdaec4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 17:55:58,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 17:55:58,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:58,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-16 17:55:58,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:55:58,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-16 17:55:58,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:55:58,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:55:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 39090692, now seen corresponding path program 1 times [2025-03-16 17:55:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:55:58,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000722720] [2025-03-16 17:55:58,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:55:58,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:55:58,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-16 17:55:58,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-16 17:55:58,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:55:58,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 17:55:58,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:55:58,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000722720] [2025-03-16 17:55:58,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000722720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:55:58,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:55:58,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:55:58,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428306451] [2025-03-16 17:55:58,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:55:58,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:55:58,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:55:58,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:55:58,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:55:58,813 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:55:58,839 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2025-03-16 17:55:58,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:55:58,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-16 17:55:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:55:58,845 INFO L225 Difference]: With dead ends: 21 [2025-03-16 17:55:58,845 INFO L226 Difference]: Without dead ends: 9 [2025-03-16 17:55:58,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 17:55:58,848 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:55:58,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 14 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:55:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2025-03-16 17:55:58,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2025-03-16 17:55:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2025-03-16 17:55:58,867 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 5 [2025-03-16 17:55:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:55:58,867 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2025-03-16 17:55:58,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:58,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2025-03-16 17:55:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-16 17:55:58,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:55:58,868 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:55:58,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 17:55:58,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:55:58,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:55:58,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1115121246, now seen corresponding path program 1 times [2025-03-16 17:55:58,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:55:58,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447904865] [2025-03-16 17:55:58,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:55:58,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:55:58,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-16 17:55:58,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-16 17:55:58,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:55:58,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:55:58,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:55:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447904865] [2025-03-16 17:55:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447904865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 17:55:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 17:55:58,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 17:55:58,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995823650] [2025-03-16 17:55:58,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 17:55:58,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 17:55:58,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:55:58,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 17:55:58,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 17:55:58,939 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:58,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:55:58,956 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2025-03-16 17:55:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 17:55:58,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-16 17:55:58,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:55:58,957 INFO L225 Difference]: With dead ends: 13 [2025-03-16 17:55:58,957 INFO L226 Difference]: Without dead ends: 10 [2025-03-16 17:55:58,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 17:55:58,958 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:55:58,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:55:58,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-16 17:55:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-03-16 17:55:58,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:58,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2025-03-16 17:55:58,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 12 transitions. Word has length 7 [2025-03-16 17:55:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:55:58,961 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 12 transitions. [2025-03-16 17:55:58,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 12 transitions. [2025-03-16 17:55:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-16 17:55:58,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:55:58,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 17:55:58,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 17:55:58,962 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:55:58,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:55:58,963 INFO L85 PathProgramCache]: Analyzing trace with hash -208988512, now seen corresponding path program 1 times [2025-03-16 17:55:58,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:55:58,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028893376] [2025-03-16 17:55:58,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:55:58,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:55:58,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 17:55:58,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 17:55:58,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:55:58,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:55:59,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:55:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028893376] [2025-03-16 17:55:59,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028893376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:55:59,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375894348] [2025-03-16 17:55:59,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:55:59,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:55:59,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:55:59,039 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 17:55:59,041 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 17:55:59,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-16 17:55:59,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-16 17:55:59,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:55:59,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:59,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 17:55:59,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:55:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:55:59,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:55:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-16 17:55:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375894348] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:55:59,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:55:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-16 17:55:59,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142272719] [2025-03-16 17:55:59,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:55:59,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 17:55:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:55:59,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 17:55:59,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:55:59,119 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:55:59,143 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2025-03-16 17:55:59,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 17:55:59,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-16 17:55:59,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:55:59,143 INFO L225 Difference]: With dead ends: 22 [2025-03-16 17:55:59,143 INFO L226 Difference]: Without dead ends: 15 [2025-03-16 17:55:59,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 17:55:59,144 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:55:59,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 8 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:55:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-16 17:55:59,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-16 17:55:59,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-03-16 17:55:59,150 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 8 [2025-03-16 17:55:59,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:55:59,150 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-03-16 17:55:59,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-03-16 17:55:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-16 17:55:59,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:55:59,151 INFO L218 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 17:55:59,157 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 17:55:59,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:55:59,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:55:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:55:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -257550972, now seen corresponding path program 1 times [2025-03-16 17:55:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:55:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158300439] [2025-03-16 17:55:59,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:55:59,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:55:59,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:55:59,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:55:59,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:55:59,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:55:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:55:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158300439] [2025-03-16 17:55:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158300439] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:55:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143302528] [2025-03-16 17:55:59,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 17:55:59,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:55:59,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:55:59,455 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 17:55:59,456 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 17:55:59,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-16 17:55:59,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-16 17:55:59,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:55:59,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:59,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:55:59,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:55:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:55:59,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:55:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:55:59,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143302528] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:55:59,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:55:59,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 17:55:59,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429439448] [2025-03-16 17:55:59,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:55:59,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:55:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:55:59,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:55:59,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:55:59,569 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:59,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:55:59,607 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2025-03-16 17:55:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:55:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-16 17:55:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:55:59,608 INFO L225 Difference]: With dead ends: 33 [2025-03-16 17:55:59,608 INFO L226 Difference]: Without dead ends: 23 [2025-03-16 17:55:59,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:55:59,608 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:55:59,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:55:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-16 17:55:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-16 17:55:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2025-03-16 17:55:59,614 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2025-03-16 17:55:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:55:59,614 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2025-03-16 17:55:59,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:55:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2025-03-16 17:55:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-16 17:55:59,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:55:59,614 INFO L218 NwaCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 17:55:59,622 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 17:55:59,820 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 17:55:59,820 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:55:59,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:55:59,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1397171444, now seen corresponding path program 2 times [2025-03-16 17:55:59,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:55:59,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086665452] [2025-03-16 17:55:59,821 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:55:59,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:55:59,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-16 17:55:59,838 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:55:59,838 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:55:59,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:55:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:55:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:55:59,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086665452] [2025-03-16 17:55:59,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086665452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:55:59,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229943402] [2025-03-16 17:55:59,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:55:59,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:55:59,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:55:59,984 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 17:55:59,985 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 17:56:00,009 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-16 17:56:00,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-16 17:56:00,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:56:00,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:00,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 17:56:00,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:56:00,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 17:56:00,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229943402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:00,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-16 17:56:00,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321707806] [2025-03-16 17:56:00,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 17:56:00,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:00,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 17:56:00,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:56:00,182 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:00,228 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2025-03-16 17:56:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:56:00,229 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-16 17:56:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:00,229 INFO L225 Difference]: With dead ends: 49 [2025-03-16 17:56:00,229 INFO L226 Difference]: Without dead ends: 39 [2025-03-16 17:56:00,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-16 17:56:00,230 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:00,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:00,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-16 17:56:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-16 17:56:00,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-16 17:56:00,234 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 22 [2025-03-16 17:56:00,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:00,234 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-16 17:56:00,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:00,234 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-16 17:56:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 17:56:00,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:00,235 INFO L218 NwaCegarLoop]: trace histogram [16, 14, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 17:56:00,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 17:56:00,435 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 17:56:00,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:00,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1900524004, now seen corresponding path program 3 times [2025-03-16 17:56:00,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:00,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175999033] [2025-03-16 17:56:00,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:00,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 17 equivalence classes. [2025-03-16 17:56:00,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 12 of 38 statements. [2025-03-16 17:56:00,447 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:56:00,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:00,510 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-16 17:56:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175999033] [2025-03-16 17:56:00,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175999033] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:00,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053862968] [2025-03-16 17:56:00,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:00,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:00,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:00,513 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 17:56:00,515 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 17:56:00,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 17 equivalence classes. [2025-03-16 17:56:00,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 12 of 38 statements. [2025-03-16 17:56:00,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-16 17:56:00,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:00,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:56:00,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-16 17:56:00,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 46 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-16 17:56:00,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053862968] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:00,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:00,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-16 17:56:00,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960713188] [2025-03-16 17:56:00,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:00,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-16 17:56:00,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:00,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-16 17:56:00,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:56:00,744 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:00,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:00,764 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-03-16 17:56:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:56:00,765 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-16 17:56:00,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:00,765 INFO L225 Difference]: With dead ends: 52 [2025-03-16 17:56:00,765 INFO L226 Difference]: Without dead ends: 49 [2025-03-16 17:56:00,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2025-03-16 17:56:00,766 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:00,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 32 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-16 17:56:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2025-03-16 17:56:00,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:00,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-03-16 17:56:00,774 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 38 [2025-03-16 17:56:00,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:00,775 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-03-16 17:56:00,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:00,775 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-03-16 17:56:00,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-16 17:56:00,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:00,775 INFO L218 NwaCegarLoop]: trace histogram [16, 14, 5, 2, 1, 1, 1, 1, 1] [2025-03-16 17:56:00,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 17:56:00,976 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 17:56:00,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:00,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash -106180452, now seen corresponding path program 4 times [2025-03-16 17:56:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:00,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647843140] [2025-03-16 17:56:00,976 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:56:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:00,989 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-16 17:56:00,998 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 17:56:00,998 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:56:00,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 46 proven. 15 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-16 17:56:01,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:01,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647843140] [2025-03-16 17:56:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647843140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:01,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951559722] [2025-03-16 17:56:01,122 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:56:01,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:01,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:01,124 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 17:56:01,125 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 17:56:01,155 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-03-16 17:56:01,171 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-16 17:56:01,171 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:56:01,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:01,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-16 17:56:01,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:01,374 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:56:01,374 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 45 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 17:56:01,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951559722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:01,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:01,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 16] total 37 [2025-03-16 17:56:01,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919562236] [2025-03-16 17:56:01,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:01,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-16 17:56:01,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:01,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-16 17:56:01,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=883, Unknown=0, NotChecked=0, Total=1406 [2025-03-16 17:56:01,738 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:02,295 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2025-03-16 17:56:02,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-16 17:56:02,295 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-16 17:56:02,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:02,296 INFO L225 Difference]: With dead ends: 96 [2025-03-16 17:56:02,297 INFO L226 Difference]: Without dead ends: 82 [2025-03-16 17:56:02,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 718 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1603, Invalid=2953, Unknown=0, NotChecked=0, Total=4556 [2025-03-16 17:56:02,300 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:02,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 29 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:56:02,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-16 17:56:02,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2025-03-16 17:56:02,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:02,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2025-03-16 17:56:02,311 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 42 [2025-03-16 17:56:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:02,311 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2025-03-16 17:56:02,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1578947368421053) internal successors, (82), 37 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:02,311 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2025-03-16 17:56:02,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 17:56:02,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:02,312 INFO L218 NwaCegarLoop]: trace histogram [32, 30, 6, 2, 1, 1, 1, 1, 1] [2025-03-16 17:56:02,318 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 17:56:02,512 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 17:56:02,513 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1296501958, now seen corresponding path program 5 times [2025-03-16 17:56:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:02,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080330340] [2025-03-16 17:56:02,513 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:56:02,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:02,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 33 equivalence classes. [2025-03-16 17:56:02,551 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 17:56:02,552 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-16 17:56:02,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 17:56:03,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:03,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080330340] [2025-03-16 17:56:03,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080330340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:03,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119861663] [2025-03-16 17:56:03,444 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 17:56:03,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:03,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:03,446 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 17:56:03,448 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 17:56:03,480 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 75 statements into 33 equivalence classes. [2025-03-16 17:56:03,511 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 17:56:03,511 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2025-03-16 17:56:03,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:03,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-16 17:56:03,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 17:56:03,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:04,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 93 proven. 930 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-16 17:56:04,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119861663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:04,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2025-03-16 17:56:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260025575] [2025-03-16 17:56:04,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:04,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-16 17:56:04,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:04,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-16 17:56:04,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 17:56:04,653 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:04,803 INFO L93 Difference]: Finished difference Result 155 states and 193 transitions. [2025-03-16 17:56:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-03-16 17:56:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2025-03-16 17:56:04,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:04,804 INFO L225 Difference]: With dead ends: 155 [2025-03-16 17:56:04,804 INFO L226 Difference]: Without dead ends: 140 [2025-03-16 17:56:04,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2025-03-16 17:56:04,806 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:04,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 17:56:04,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-16 17:56:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-16 17:56:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.0287769784172662) internal successors, (143), 139 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2025-03-16 17:56:04,823 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 75 [2025-03-16 17:56:04,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:04,824 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2025-03-16 17:56:04,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:04,824 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2025-03-16 17:56:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-16 17:56:04,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:04,827 INFO L218 NwaCegarLoop]: trace histogram [64, 62, 6, 2, 1, 1, 1, 1, 1] [2025-03-16 17:56:04,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 17:56:05,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:05,028 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:05,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:05,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1864968326, now seen corresponding path program 6 times [2025-03-16 17:56:05,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:05,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437806011] [2025-03-16 17:56:05,028 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 17:56:05,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:05,042 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 65 equivalence classes. [2025-03-16 17:56:05,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 23 of 139 statements. [2025-03-16 17:56:05,049 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-16 17:56:05,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 190 proven. 21 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-16 17:56:05,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437806011] [2025-03-16 17:56:05,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437806011] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:05,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169721055] [2025-03-16 17:56:05,126 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 17:56:05,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:05,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:05,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:56:05,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 17:56:05,168 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 139 statements into 65 equivalence classes. [2025-03-16 17:56:05,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 23 of 139 statements. [2025-03-16 17:56:05,196 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-16 17:56:05,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:05,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-16 17:56:05,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:05,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 190 proven. 21 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-16 17:56:05,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4117 backedges. 190 proven. 21 refuted. 0 times theorem prover too weak. 3906 trivial. 0 not checked. [2025-03-16 17:56:05,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169721055] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:05,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:05,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 17:56:05,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247539854] [2025-03-16 17:56:05,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:05,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 17:56:05,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:05,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 17:56:05,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2025-03-16 17:56:05,739 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:05,770 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2025-03-16 17:56:05,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 17:56:05,770 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-03-16 17:56:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:05,772 INFO L225 Difference]: With dead ends: 157 [2025-03-16 17:56:05,772 INFO L226 Difference]: Without dead ends: 154 [2025-03-16 17:56:05,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2025-03-16 17:56:05,773 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:05,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-16 17:56:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2025-03-16 17:56:05,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0272108843537415) internal successors, (151), 147 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2025-03-16 17:56:05,791 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 139 [2025-03-16 17:56:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:05,791 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2025-03-16 17:56:05,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2025-03-16 17:56:05,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-16 17:56:05,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:05,792 INFO L218 NwaCegarLoop]: trace histogram [64, 62, 14, 2, 1, 1, 1, 1, 1] [2025-03-16 17:56:05,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 17:56:05,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:05,993 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:05,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash -43588730, now seen corresponding path program 7 times [2025-03-16 17:56:05,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:05,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617672209] [2025-03-16 17:56:05,994 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 17:56:05,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:06,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 17:56:06,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 17:56:06,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:56:06,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:08,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 17:56:08,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617672209] [2025-03-16 17:56:08,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617672209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:08,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908495087] [2025-03-16 17:56:08,510 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 17:56:08,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:08,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:08,512 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:56:08,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 17:56:08,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-16 17:56:08,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-16 17:56:08,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 17:56:08,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:08,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 126 conjuncts are in the unsatisfiable core [2025-03-16 17:56:08,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 17:56:08,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4201 backedges. 189 proven. 3906 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 17:56:11,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908495087] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:11,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:11,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2025-03-16 17:56:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197694930] [2025-03-16 17:56:11,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:11,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-16 17:56:11,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:11,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-16 17:56:11,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-16 17:56:11,906 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand has 128 states, 128 states have (on average 2.0390625) internal successors, (261), 127 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:12,187 INFO L93 Difference]: Finished difference Result 299 states and 369 transitions. [2025-03-16 17:56:12,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-16 17:56:12,187 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 2.0390625) internal successors, (261), 127 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2025-03-16 17:56:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:12,188 INFO L225 Difference]: With dead ends: 299 [2025-03-16 17:56:12,188 INFO L226 Difference]: Without dead ends: 276 [2025-03-16 17:56:12,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2025-03-16 17:56:12,192 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:12,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 17:56:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-16 17:56:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-03-16 17:56:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.0145454545454546) internal successors, (279), 275 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 279 transitions. [2025-03-16 17:56:12,226 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 279 transitions. Word has length 147 [2025-03-16 17:56:12,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:12,226 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 279 transitions. [2025-03-16 17:56:12,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 2.0390625) internal successors, (261), 127 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:12,226 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 279 transitions. [2025-03-16 17:56:12,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-16 17:56:12,228 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:12,229 INFO L218 NwaCegarLoop]: trace histogram [128, 126, 14, 2, 1, 1, 1, 1, 1] [2025-03-16 17:56:12,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 17:56:12,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 17:56:12,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:12,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash 822188806, now seen corresponding path program 8 times [2025-03-16 17:56:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:12,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188039078] [2025-03-16 17:56:12,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:56:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:12,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 275 statements into 2 equivalence classes. [2025-03-16 17:56:12,467 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 275 of 275 statements. [2025-03-16 17:56:12,467 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:56:12,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 16489 backedges. 382 proven. 105 refuted. 0 times theorem prover too weak. 16002 trivial. 0 not checked. [2025-03-16 17:56:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:12,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188039078] [2025-03-16 17:56:12,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188039078] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:12,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473931435] [2025-03-16 17:56:12,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 17:56:12,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:12,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:12,819 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:56:12,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 17:56:12,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 275 statements into 2 equivalence classes. [2025-03-16 17:56:12,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 275 of 275 statements. [2025-03-16 17:56:12,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 17:56:12,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:12,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 254 conjuncts are in the unsatisfiable core [2025-03-16 17:56:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16489 backedges. 381 proven. 16002 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 17:56:17,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16489 backedges. 381 proven. 16002 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 17:56:30,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473931435] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:30,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:30,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 128, 128] total 270 [2025-03-16 17:56:30,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483447472] [2025-03-16 17:56:30,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:30,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 271 states [2025-03-16 17:56:30,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:30,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 271 interpolants. [2025-03-16 17:56:30,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32775, Invalid=40395, Unknown=0, NotChecked=0, Total=73170 [2025-03-16 17:56:30,137 INFO L87 Difference]: Start difference. First operand 276 states and 279 transitions. Second operand has 271 states, 271 states have (on average 1.988929889298893) internal successors, (539), 270 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:47,985 INFO L93 Difference]: Finished difference Result 562 states and 700 transitions. [2025-03-16 17:56:47,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2025-03-16 17:56:47,985 INFO L78 Accepts]: Start accepts. Automaton has has 271 states, 271 states have (on average 1.988929889298893) internal successors, (539), 270 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-03-16 17:56:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:47,987 INFO L225 Difference]: With dead ends: 562 [2025-03-16 17:56:47,987 INFO L226 Difference]: Without dead ends: 539 [2025-03-16 17:56:47,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 820 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 523 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43864 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=101101, Invalid=173999, Unknown=0, NotChecked=0, Total=275100 [2025-03-16 17:56:47,994 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:47,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 27 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 17:56:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-03-16 17:56:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 533. [2025-03-16 17:56:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 532 states have (on average 1.0075187969924813) internal successors, (536), 532 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 536 transitions. [2025-03-16 17:56:48,022 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 536 transitions. Word has length 275 [2025-03-16 17:56:48,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:48,022 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 536 transitions. [2025-03-16 17:56:48,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 271 states, 271 states have (on average 1.988929889298893) internal successors, (539), 270 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 536 transitions. [2025-03-16 17:56:48,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-03-16 17:56:48,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:48,027 INFO L218 NwaCegarLoop]: trace histogram [256, 254, 15, 2, 1, 1, 1, 1, 1] [2025-03-16 17:56:48,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 17:56:48,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:48,228 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:48,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:48,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1701662020, now seen corresponding path program 9 times [2025-03-16 17:56:48,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177636151] [2025-03-16 17:56:48,228 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:48,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:48,260 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 532 statements into 257 equivalence classes. [2025-03-16 17:56:48,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 532 statements. [2025-03-16 17:56:48,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 17:56:48,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 65656 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64382 trivial. 0 not checked. [2025-03-16 17:56:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177636151] [2025-03-16 17:56:48,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177636151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:48,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695502473] [2025-03-16 17:56:48,287 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 17:56:48,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:48,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:48,289 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:56:48,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 17:56:48,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 532 statements into 257 equivalence classes. [2025-03-16 17:56:48,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 25 of 532 statements. [2025-03-16 17:56:48,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-16 17:56:48,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:48,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 17:56:48,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:56:48,430 INFO L134 CoverageAnalysis]: Checked inductivity of 65656 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64382 trivial. 0 not checked. [2025-03-16 17:56:48,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 17:56:48,454 INFO L134 CoverageAnalysis]: Checked inductivity of 65656 backedges. 1270 proven. 4 refuted. 0 times theorem prover too weak. 64382 trivial. 0 not checked. [2025-03-16 17:56:48,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695502473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 17:56:48,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 17:56:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-16 17:56:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803634706] [2025-03-16 17:56:48,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 17:56:48,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 17:56:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 17:56:48,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 17:56:48,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:56:48,455 INFO L87 Difference]: Start difference. First operand 533 states and 536 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 17:56:48,502 INFO L93 Difference]: Finished difference Result 560 states and 571 transitions. [2025-03-16 17:56:48,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 17:56:48,503 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 532 [2025-03-16 17:56:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 17:56:48,506 INFO L225 Difference]: With dead ends: 560 [2025-03-16 17:56:48,506 INFO L226 Difference]: Without dead ends: 541 [2025-03-16 17:56:48,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1067 GetRequests, 1061 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 17:56:48,508 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 17:56:48,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 17:56:48,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-16 17:56:48,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-03-16 17:56:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 540 states have (on average 1.0148148148148148) internal successors, (548), 540 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:48,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 548 transitions. [2025-03-16 17:56:48,555 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 548 transitions. Word has length 532 [2025-03-16 17:56:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 17:56:48,556 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 548 transitions. [2025-03-16 17:56:48,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 17:56:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 548 transitions. [2025-03-16 17:56:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-16 17:56:48,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 17:56:48,561 INFO L218 NwaCegarLoop]: trace histogram [260, 254, 15, 6, 1, 1, 1, 1, 1] [2025-03-16 17:56:48,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 17:56:48,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-16 17:56:48,762 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 17:56:48,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 17:56:48,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1080280896, now seen corresponding path program 10 times [2025-03-16 17:56:48,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 17:56:48,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941998568] [2025-03-16 17:56:48,762 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:56:48,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 17:56:48,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 540 statements into 2 equivalence classes. [2025-03-16 17:56:48,815 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 540 of 540 statements. [2025-03-16 17:56:48,815 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:56:48,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 67720 backedges. 2830 proven. 120 refuted. 0 times theorem prover too weak. 64770 trivial. 0 not checked. [2025-03-16 17:56:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 17:56:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941998568] [2025-03-16 17:56:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941998568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 17:56:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244338184] [2025-03-16 17:56:49,445 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 17:56:49,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 17:56:49,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 17:56:49,447 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 17:56:49,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 17:56:49,572 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 540 statements into 2 equivalence classes. [2025-03-16 17:56:49,727 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 540 of 540 statements. [2025-03-16 17:56:49,728 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 17:56:49,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 17:56:49,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1671 conjuncts, 510 conjuncts are in the unsatisfiable core [2025-03-16 17:56:49,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 17:57:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 67720 backedges. 2805 proven. 64770 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-16 17:57:06,981 INFO L312 TraceCheckSpWp]: Computing backward predicates...