./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ms5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ms5.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 5d49931b392f3e5db08af1630b313adf7396c4587f1a053ae0de1991b384d39a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:37:37,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:37:37,702 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:37:37,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:37:37,706 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:37:37,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:37:37,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:37:37,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:37:37,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:37:37,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:37:37,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:37:37,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:37:37,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:37:37,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:37:37,730 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:37:37,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:37:37,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:37:37,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:37:37,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:37:37,732 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:37:37,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:37:37,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:37:37,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:37:37,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:37:37,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:37:37,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:37:37,733 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 -> 5d49931b392f3e5db08af1630b313adf7396c4587f1a053ae0de1991b384d39a [2025-03-03 09:37:37,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:37:37,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:37:37,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:37:37,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:37:37,987 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:37:37,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ms5.c [2025-03-03 09:37:39,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a95ffeba/90df85f7feab44bf8d119378435f5b83/FLAG3f11631cd [2025-03-03 09:37:39,386 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:37:39,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms5.c [2025-03-03 09:37:39,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a95ffeba/90df85f7feab44bf8d119378435f5b83/FLAG3f11631cd [2025-03-03 09:37:39,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a95ffeba/90df85f7feab44bf8d119378435f5b83 [2025-03-03 09:37:39,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:37:39,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:37:39,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:37:39,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:37:39,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:37:39,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2984c5fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39, skipping insertion in model container [2025-03-03 09:37:39,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:37:39,542 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms5.c[586,599] [2025-03-03 09:37:39,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:37:39,573 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:37:39,581 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ms5.c[586,599] [2025-03-03 09:37:39,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:37:39,601 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:37:39,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39 WrapperNode [2025-03-03 09:37:39,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:37:39,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:37:39,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:37:39,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:37:39,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,634 INFO L138 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 64 [2025-03-03 09:37:39,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:37:39,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:37:39,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:37:39,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:37:39,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,655 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 6, 2, 4]. 43 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0, 0]. The 3 writes are split as follows [0, 0, 1, 2]. [2025-03-03 09:37:39,656 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,656 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:37:39,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:37:39,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:37:39,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:37:39,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (1/1) ... [2025-03-03 09:37:39,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:37:39,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:39,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:37:39,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:37:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:37:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:37:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:37:39,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:37:39,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:37:39,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:37:39,791 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:37:39,792 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:37:39,920 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-03 09:37:39,929 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:37:39,929 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:37:39,936 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:37:39,937 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:37:39,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:37:39 BoogieIcfgContainer [2025-03-03 09:37:39,938 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:37:39,940 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:37:39,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:37:39,944 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:37:39,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:37:39" (1/3) ... [2025-03-03 09:37:39,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6852b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:37:39, skipping insertion in model container [2025-03-03 09:37:39,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:37:39" (2/3) ... [2025-03-03 09:37:39,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6852b47e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:37:39, skipping insertion in model container [2025-03-03 09:37:39,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:37:39" (3/3) ... [2025-03-03 09:37:39,946 INFO L128 eAbstractionObserver]: Analyzing ICFG ms5.c [2025-03-03 09:37:39,959 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:37:39,960 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ms5.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:37:39,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:37:40,009 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;@5d59a4ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:37:40,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:37:40,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 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-03 09:37:40,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:37:40,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:40,017 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:40,018 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:40,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash -673256721, now seen corresponding path program 1 times [2025-03-03 09:37:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:40,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816007311] [2025-03-03 09:37:40,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:37:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:40,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:37:40,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:37:40,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:37:40,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:40,132 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-03 09:37:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816007311] [2025-03-03 09:37:40,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816007311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:37:40,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:37:40,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:37:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675985589] [2025-03-03 09:37:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:37:40,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:37:40,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:40,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:37:40,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:37:40,155 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 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) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03 09:37:40,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:40,164 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-03 09:37:40,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:37:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-03-03 09:37:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:40,171 INFO L225 Difference]: With dead ends: 28 [2025-03-03 09:37:40,172 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 09:37:40,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:37:40,176 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:40,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:37:40,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 09:37:40,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 09:37:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-03 09:37:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-03 09:37:40,199 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-03-03 09:37:40,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:40,199 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-03 09:37:40,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-03 09:37:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-03 09:37:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:37:40,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:40,200 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:40,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:37:40,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:40,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:40,201 INFO L85 PathProgramCache]: Analyzing trace with hash -644627570, now seen corresponding path program 1 times [2025-03-03 09:37:40,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:40,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580451580] [2025-03-03 09:37:40,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:37:40,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:40,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:37:40,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:37:40,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:37:40,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:40,320 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-03 09:37:40,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:40,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580451580] [2025-03-03 09:37:40,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580451580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:37:40,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:37:40,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:37:40,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589826484] [2025-03-03 09:37:40,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:37:40,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:37:40,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:40,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:37:40,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:37:40,323 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03 09:37:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:40,381 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-03 09:37:40,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:37:40,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-03 09:37:40,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:40,382 INFO L225 Difference]: With dead ends: 22 [2025-03-03 09:37:40,382 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 09:37:40,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:37:40,383 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:40,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 10 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:37:40,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 09:37:40,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-03 09:37:40,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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-03 09:37:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-03 09:37:40,386 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2025-03-03 09:37:40,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:40,386 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-03 09:37:40,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-03 09:37:40,386 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-03-03 09:37:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:37:40,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:40,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:40,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:37:40,387 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:40,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 380854543, now seen corresponding path program 1 times [2025-03-03 09:37:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:40,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740885244] [2025-03-03 09:37:40,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:37:40,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:40,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:37:40,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:37:40,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:37:40,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:40,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:37:40,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:40,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740885244] [2025-03-03 09:37:40,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740885244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:37:40,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:37:40,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:37:40,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535887068] [2025-03-03 09:37:40,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:37:40,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:37:40,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:40,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:37:40,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:37:40,583 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-03 09:37:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:40,627 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2025-03-03 09:37:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:37:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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) Word has length 13 [2025-03-03 09:37:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:40,629 INFO L225 Difference]: With dead ends: 21 [2025-03-03 09:37:40,629 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:37:40,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:37:40,629 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:40,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:37:40,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:37:40,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2025-03-03 09:37:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 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-03 09:37:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-03 09:37:40,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2025-03-03 09:37:40,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:40,632 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-03 09:37:40,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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-03 09:37:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-03 09:37:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:37:40,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:40,633 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:40,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:37:40,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:40,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:40,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1146644267, now seen corresponding path program 1 times [2025-03-03 09:37:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:40,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934081289] [2025-03-03 09:37:40,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:37:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:40,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:37:40,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:37:40,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:37:40,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:40,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:40,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934081289] [2025-03-03 09:37:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934081289] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:40,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979755356] [2025-03-03 09:37:40,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:37:40,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:40,743 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:37:40,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:37:40,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 09:37:40,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:37:40,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:37:40,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:40,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:37:40,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:40,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:40,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979755356] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:40,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:40,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:37:40,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503735786] [2025-03-03 09:37:40,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:40,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:37:40,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:40,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:37:40,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:37:40,911 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-03 09:37:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:40,975 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2025-03-03 09:37:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:37:40,977 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 16 [2025-03-03 09:37:40,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:40,977 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:37:40,977 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:37:40,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:37:40,978 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:40,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:37:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:37:40,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 09:37:40,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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-03 09:37:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-03 09:37:40,982 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-03-03 09:37:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:40,982 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-03 09:37:40,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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-03 09:37:40,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-03 09:37:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:37:40,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:40,983 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:40,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:37:41,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:41,184 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:41,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 906134127, now seen corresponding path program 2 times [2025-03-03 09:37:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396629391] [2025-03-03 09:37:41,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:37:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:41,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 09:37:41,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:37:41,236 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:37:41,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:41,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396629391] [2025-03-03 09:37:41,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396629391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:41,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957826029] [2025-03-03 09:37:41,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:37:41,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:41,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:41,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:37:41,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:37:41,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-03 09:37:41,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:37:41,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:37:41,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:41,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:37:41,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:41,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:41,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:42,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:42,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:42,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2025-03-03 09:37:42,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:42,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 77 [2025-03-03 09:37:42,349 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:37:42,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2025-03-03 09:37:42,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:42,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957826029] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:42,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:42,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 25 [2025-03-03 09:37:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184469312] [2025-03-03 09:37:42,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:42,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:37:42,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:42,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:37:42,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:37:42,384 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-03 09:37:42,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:42,828 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2025-03-03 09:37:42,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:37:42,828 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 17 [2025-03-03 09:37:42,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:42,829 INFO L225 Difference]: With dead ends: 49 [2025-03-03 09:37:42,829 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 09:37:42,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 09:37:42,830 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 68 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:42,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 86 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:37:42,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 09:37:42,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-03-03 09:37:42,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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-03 09:37:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2025-03-03 09:37:42,835 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 17 [2025-03-03 09:37:42,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:42,835 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2025-03-03 09:37:42,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-03 09:37:42,835 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2025-03-03 09:37:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:37:42,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:42,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:42,842 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-03 09:37:43,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:43,040 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:43,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:43,041 INFO L85 PathProgramCache]: Analyzing trace with hash -832763889, now seen corresponding path program 3 times [2025-03-03 09:37:43,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:43,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237568196] [2025-03-03 09:37:43,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:37:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:43,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-03 09:37:43,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:37:43,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:37:43,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:44,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237568196] [2025-03-03 09:37:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237568196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:44,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967083745] [2025-03-03 09:37:44,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:37:44,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:44,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:44,546 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-03 09:37:44,548 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-03 09:37:44,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-03 09:37:44,596 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:37:44,596 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:37:44,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:44,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 09:37:44,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:44,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:44,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:37:44,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:44,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-03 09:37:45,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-03 09:37:45,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:45,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:45,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:45,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 32 [2025-03-03 09:37:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:45,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:45,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2025-03-03 09:37:45,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:45,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 77 [2025-03-03 09:37:45,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2025-03-03 09:37:45,713 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:45,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967083745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:45,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:45,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 14] total 42 [2025-03-03 09:37:45,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962756769] [2025-03-03 09:37:45,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:45,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 09:37:45,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:45,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 09:37:45,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1440, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:37:45,716 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 42 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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-03 09:37:47,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:47,506 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2025-03-03 09:37:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 09:37:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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 21 [2025-03-03 09:37:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:47,508 INFO L225 Difference]: With dead ends: 80 [2025-03-03 09:37:47,508 INFO L226 Difference]: Without dead ends: 67 [2025-03-03 09:37:47,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1407, Invalid=5073, Unknown=0, NotChecked=0, Total=6480 [2025-03-03 09:37:47,514 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 199 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:47,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 78 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:37:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-03 09:37:47,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2025-03-03 09:37:47,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 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-03 09:37:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2025-03-03 09:37:47,529 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 21 [2025-03-03 09:37:47,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:47,529 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2025-03-03 09:37:47,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 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-03 09:37:47,529 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2025-03-03 09:37:47,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:37:47,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:47,530 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:47,536 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-03 09:37:47,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:47,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:47,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1201052847, now seen corresponding path program 4 times [2025-03-03 09:37:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:47,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291404400] [2025-03-03 09:37:47,731 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:37:47,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:47,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-03 09:37:47,751 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:37:47,754 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:37:47,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:47,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291404400] [2025-03-03 09:37:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291404400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776000560] [2025-03-03 09:37:47,818 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:37:47,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:47,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:47,820 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-03 09:37:47,836 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-03 09:37:47,863 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-03-03 09:37:47,880 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:37:47,880 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:37:47,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:47,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:37:47,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:47,928 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:37:47,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:37:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776000560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:47,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2025-03-03 09:37:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872369020] [2025-03-03 09:37:47,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:47,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:37:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:47,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:37:47,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:37:47,956 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-03 09:37:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:48,024 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2025-03-03 09:37:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:37:48,024 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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 23 [2025-03-03 09:37:48,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:48,024 INFO L225 Difference]: With dead ends: 66 [2025-03-03 09:37:48,024 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 09:37:48,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:37:48,025 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:48,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 25 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:37:48,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 09:37:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-03 09:37:48,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2045454545454546) internal successors, (53), 44 states have internal predecessors, (53), 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-03 09:37:48,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2025-03-03 09:37:48,035 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 23 [2025-03-03 09:37:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:48,036 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2025-03-03 09:37:48,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 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-03 09:37:48,036 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2025-03-03 09:37:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:37:48,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:48,036 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:48,043 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-03 09:37:48,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:48,237 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:48,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1110097553, now seen corresponding path program 5 times [2025-03-03 09:37:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572992440] [2025-03-03 09:37:48,238 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:37:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:48,246 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 5 equivalence classes. [2025-03-03 09:37:48,284 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:37:48,287 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:37:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572992440] [2025-03-03 09:37:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572992440] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925701165] [2025-03-03 09:37:48,911 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:37:48,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:48,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:48,913 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-03 09:37:48,915 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-03 09:37:48,949 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 5 equivalence classes. [2025-03-03 09:37:48,990 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:37:48,990 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:37:48,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:48,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 09:37:48,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:49,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:49,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:37:49,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:49,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:37:49,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:49,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:49,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:49,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:49,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:49,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2025-03-03 09:37:49,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:49,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 77 [2025-03-03 09:37:49,995 INFO L349 Elim1Store]: treesize reduction 67, result has 43.2 percent of original size [2025-03-03 09:37:49,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7676 treesize of output 6935 [2025-03-03 09:37:50,116 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-03 09:37:50,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3994 treesize of output 3623 [2025-03-03 09:37:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925701165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:50,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:50,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 39 [2025-03-03 09:37:50,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812410260] [2025-03-03 09:37:50,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:50,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-03 09:37:50,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:50,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-03 09:37:50,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 09:37:50,166 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 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-03 09:37:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:50,660 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2025-03-03 09:37:50,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:37:50,661 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 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 25 [2025-03-03 09:37:50,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:50,662 INFO L225 Difference]: With dead ends: 71 [2025-03-03 09:37:50,662 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 09:37:50,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=244, Invalid=1648, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 09:37:50,665 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:50,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 121 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:37:50,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 09:37:50,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-03 09:37:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 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-03 09:37:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2025-03-03 09:37:50,677 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 25 [2025-03-03 09:37:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:50,677 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2025-03-03 09:37:50,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 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-03 09:37:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2025-03-03 09:37:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:37:50,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:50,678 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:50,684 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-03 09:37:50,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:50,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:50,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash 451239029, now seen corresponding path program 6 times [2025-03-03 09:37:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:50,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660869663] [2025-03-03 09:37:50,879 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:37:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:50,887 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 6 equivalence classes. [2025-03-03 09:37:50,896 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 25 of 28 statements. [2025-03-03 09:37:50,897 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:37:50,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:37:51,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660869663] [2025-03-03 09:37:51,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660869663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:51,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042767247] [2025-03-03 09:37:51,054 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:37:51,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:51,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:51,056 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-03 09:37:51,058 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-03 09:37:51,094 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 6 equivalence classes. [2025-03-03 09:37:51,126 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 25 of 28 statements. [2025-03-03 09:37:51,126 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:37:51,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:51,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 09:37:51,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:37:51,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:37:51,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042767247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:51,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:51,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 23 [2025-03-03 09:37:51,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361352293] [2025-03-03 09:37:51,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:51,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:37:51,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:51,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:37:51,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:37:51,312 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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-03 09:37:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:51,686 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2025-03-03 09:37:51,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 09:37:51,689 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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 28 [2025-03-03 09:37:51,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:51,689 INFO L225 Difference]: With dead ends: 107 [2025-03-03 09:37:51,689 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 09:37:51,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=336, Invalid=1734, Unknown=0, NotChecked=0, Total=2070 [2025-03-03 09:37:51,690 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 78 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:51,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 41 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:37:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 09:37:51,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 49. [2025-03-03 09:37:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 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-03 09:37:51,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-03 09:37:51,697 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 28 [2025-03-03 09:37:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:51,697 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-03 09:37:51,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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-03 09:37:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-03 09:37:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:37:51,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:51,698 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:51,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:37:51,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:51,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:51,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:51,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1711493361, now seen corresponding path program 7 times [2025-03-03 09:37:51,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:51,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429618566] [2025-03-03 09:37:51,902 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:37:51,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:51,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:37:51,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:37:51,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:37:51,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:52,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429618566] [2025-03-03 09:37:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429618566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710243500] [2025-03-03 09:37:52,878 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:37:52,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:52,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:52,880 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-03 09:37:52,881 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-03 09:37:52,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:37:52,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:37:52,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:37:52,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:52,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 09:37:52,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:52,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:52,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:37:53,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:53,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:37:53,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:53,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:37:53,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:37:53,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:53,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:53,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:53,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:37:53,512 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:53,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:54,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2025-03-03 09:37:54,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:54,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 77 [2025-03-03 09:37:54,250 INFO L349 Elim1Store]: treesize reduction 5, result has 84.8 percent of original size [2025-03-03 09:37:54,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 2205666 treesize of output 2074615 [2025-03-03 09:37:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710243500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:54,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 51 [2025-03-03 09:37:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151406047] [2025-03-03 09:37:54,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:54,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 09:37:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:54,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 09:37:54,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=2188, Unknown=0, NotChecked=0, Total=2550 [2025-03-03 09:37:54,430 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 51 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 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-03 09:37:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:55,138 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-03-03 09:37:55,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-03 09:37:55,139 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 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 29 [2025-03-03 09:37:55,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:55,139 INFO L225 Difference]: With dead ends: 63 [2025-03-03 09:37:55,139 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 09:37:55,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=454, Invalid=2968, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 09:37:55,140 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:55,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 129 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:37:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 09:37:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2025-03-03 09:37:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 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-03 09:37:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2025-03-03 09:37:55,146 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 29 [2025-03-03 09:37:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2025-03-03 09:37:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 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-03 09:37:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2025-03-03 09:37:55,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:37:55,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:55,147 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:55,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:37:55,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:55,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:55,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:55,352 INFO L85 PathProgramCache]: Analyzing trace with hash -644806763, now seen corresponding path program 8 times [2025-03-03 09:37:55,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:55,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732995814] [2025-03-03 09:37:55,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:37:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:55,357 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:37:55,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:37:55,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:37:55,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:55,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732995814] [2025-03-03 09:37:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732995814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:55,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692734624] [2025-03-03 09:37:55,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:37:55,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:55,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:55,448 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-03 09:37:55,450 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-03 09:37:55,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-03 09:37:55,507 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:37:55,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:37:55,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:55,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:37:55,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:37:55,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:37:55,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692734624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:55,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:55,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 18 [2025-03-03 09:37:55,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875580696] [2025-03-03 09:37:55,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:55,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:37:55,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:55,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:37:55,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:37:55,630 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 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-03 09:37:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:55,709 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-03-03 09:37:55,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:37:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 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 30 [2025-03-03 09:37:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:55,710 INFO L225 Difference]: With dead ends: 63 [2025-03-03 09:37:55,710 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 09:37:55,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:37:55,711 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:55,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:37:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 09:37:55,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 09:37:55,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 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-03 09:37:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-03 09:37:55,721 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2025-03-03 09:37:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:55,722 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-03 09:37:55,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 18 states have internal predecessors, (49), 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-03 09:37:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-03 09:37:55,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:37:55,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:55,723 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:55,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:37:55,927 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,SelfDestructingSolverStorable10 [2025-03-03 09:37:55,927 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:55,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:55,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1422685483, now seen corresponding path program 9 times [2025-03-03 09:37:55,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:55,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733357316] [2025-03-03 09:37:55,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:37:55,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:55,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 7 equivalence classes. [2025-03-03 09:37:55,968 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:37:55,968 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:37:55,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 38 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:56,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733357316] [2025-03-03 09:37:56,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733357316] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:56,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148750661] [2025-03-03 09:37:56,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:37:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:56,105 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-03 09:37:56,107 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-03 09:37:56,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 7 equivalence classes. [2025-03-03 09:37:56,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:37:56,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:37:56,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:56,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:37:56,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:56,319 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:56,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:37:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:37:56,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148750661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:37:56,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:37:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2025-03-03 09:37:56,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445063775] [2025-03-03 09:37:56,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:37:56,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:37:56,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:37:56,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:37:56,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:37:56,398 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 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-03 09:37:56,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:37:56,497 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2025-03-03 09:37:56,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:37:56,497 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 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 32 [2025-03-03 09:37:56,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:37:56,497 INFO L225 Difference]: With dead ends: 58 [2025-03-03 09:37:56,497 INFO L226 Difference]: Without dead ends: 36 [2025-03-03 09:37:56,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2025-03-03 09:37:56,498 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:37:56,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:37:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-03 09:37:56,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2025-03-03 09:37:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.0606060606060606) internal successors, (35), 33 states have internal predecessors, (35), 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-03 09:37:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2025-03-03 09:37:56,503 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 32 [2025-03-03 09:37:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:37:56,503 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2025-03-03 09:37:56,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 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-03 09:37:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2025-03-03 09:37:56,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:37:56,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:37:56,504 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:37:56,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:37:56,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:56,708 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:37:56,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:37:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1389101167, now seen corresponding path program 10 times [2025-03-03 09:37:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:37:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375854360] [2025-03-03 09:37:56,708 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:37:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:37:56,713 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-03 09:37:56,723 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-03-03 09:37:56,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:37:56,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:57,704 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:37:57,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:37:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375854360] [2025-03-03 09:37:57,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375854360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:37:57,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485029225] [2025-03-03 09:37:57,705 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:37:57,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:37:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:37:57,707 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-03 09:37:57,709 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-03 09:37:57,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-03 09:37:57,765 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 29 of 33 statements. [2025-03-03 09:37:57,765 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:37:57,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:37:57,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 09:37:57,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:37:57,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2025-03-03 09:37:57,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:37:57,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2025-03-03 09:37:57,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 117 [2025-03-03 09:37:57,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 145 [2025-03-03 09:37:57,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:57,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 20 [2025-03-03 09:37:57,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 200 [2025-03-03 09:37:57,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:37:57,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 200 treesize of output 220 [2025-03-03 09:37:58,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 118 [2025-03-03 09:37:58,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 341 treesize of output 305 [2025-03-03 09:37:58,326 INFO L349 Elim1Store]: treesize reduction 70, result has 13.6 percent of original size [2025-03-03 09:37:58,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 305 treesize of output 317 [2025-03-03 09:37:58,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:58,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:58,546 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-03 09:37:58,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 360 treesize of output 303 [2025-03-03 09:37:58,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 481 treesize of output 429 [2025-03-03 09:37:58,991 INFO L349 Elim1Store]: treesize reduction 160, result has 14.4 percent of original size [2025-03-03 09:37:58,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 19 case distinctions, treesize of input 429 treesize of output 424 [2025-03-03 09:37:59,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:37:59,602 INFO L349 Elim1Store]: treesize reduction 28, result has 46.2 percent of original size [2025-03-03 09:37:59,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 3 case distinctions, treesize of input 511 treesize of output 420 [2025-03-03 09:38:07,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:38:17,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-03-03 09:38:23,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2025-03-03 09:38:31,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2025-03-03 09:38:40,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 40 [2025-03-03 09:38:51,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2025-03-03 09:38:53,386 INFO L349 Elim1Store]: treesize reduction 832, result has 36.4 percent of original size [2025-03-03 09:38:53,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 1031 treesize of output 816 [2025-03-03 09:39:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 16 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:04,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:39:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:39:05,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485029225] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:39:05,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:39:05,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2025-03-03 09:39:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395307902] [2025-03-03 09:39:05,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:39:05,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-03 09:39:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:39:05,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-03 09:39:05,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=3213, Unknown=1, NotChecked=0, Total=3660 [2025-03-03 09:39:05,589 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 61 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 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-03 09:39:12,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]