./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_tiling_tcpy.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-cav19/array_tiling_tcpy.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 5446997f7b2d7b76d63a39784df785fb06bbab562e365ba547eeee8a855e283e --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:42:00,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:42:00,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:42:00,487 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:42:00,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:42:00,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:42:00,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:42:00,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:42:00,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:42:00,515 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:42:00,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:42:00,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:42:00,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:42:00,516 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:42:00,516 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:42:00,517 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:42:00,517 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:42:00,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:42:00,518 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:42:00,518 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:42:00,518 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:42:00,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:42:00,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:42:00,518 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:42:00,518 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:42:00,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:42:00,519 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 -> 5446997f7b2d7b76d63a39784df785fb06bbab562e365ba547eeee8a855e283e [2025-03-08 00:42:00,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:42:00,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:42:00,765 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:42:00,766 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:42:00,766 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:42:00,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_tiling_tcpy.c [2025-03-08 00:42:01,941 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc3470b4/1561387440454c12a22fbd3954b4a0ad/FLAG7cfa5a1b8 [2025-03-08 00:42:02,171 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:42:02,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_tiling_tcpy.c [2025-03-08 00:42:02,187 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc3470b4/1561387440454c12a22fbd3954b4a0ad/FLAG7cfa5a1b8 [2025-03-08 00:42:02,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc3470b4/1561387440454c12a22fbd3954b4a0ad [2025-03-08 00:42:02,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:42:02,513 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:42:02,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:42:02,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:42:02,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:42:02,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6154be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02, skipping insertion in model container [2025-03-08 00:42:02,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,530 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:42:02,616 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-cav19/array_tiling_tcpy.c[408,421] [2025-03-08 00:42:02,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:42:02,631 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:42:02,638 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-cav19/array_tiling_tcpy.c[408,421] [2025-03-08 00:42:02,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:42:02,654 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:42:02,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02 WrapperNode [2025-03-08 00:42:02,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:42:02,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:42:02,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:42:02,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:42:02,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,673 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2025-03-08 00:42:02,673 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:42:02,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:42:02,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:42:02,674 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:42:02,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,687 INFO L175 MemorySlicer]: Split 8 memory accesses to 3 slices as follows [2, 3, 3]. 38 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 2, 0]. [2025-03-08 00:42:02,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,690 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,691 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,692 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:42:02,693 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:42:02,693 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:42:02,693 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:42:02,694 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (1/1) ... [2025-03-08 00:42:02,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:42:02,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:02,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:42:02,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:42:02,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:42:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 00:42:02,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 00:42:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:42:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:42:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:42:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:42:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:42:02,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:42:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:42:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:42:02,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:42:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:42:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:42:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:42:02,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:42:02,793 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:42:02,794 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:42:02,895 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: call ULTIMATE.dealloc(main_~#a~0#1.base, main_~#a~0#1.offset);havoc main_~#a~0#1.base, main_~#a~0#1.offset;call ULTIMATE.dealloc(main_~#acopy~0#1.base, main_~#acopy~0#1.offset);havoc main_~#acopy~0#1.base, main_~#acopy~0#1.offset; [2025-03-08 00:42:02,902 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:42:02,902 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:42:02,909 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:42:02,909 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:42:02,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:42:02 BoogieIcfgContainer [2025-03-08 00:42:02,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:42:02,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:42:02,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:42:02,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:42:02,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:42:02" (1/3) ... [2025-03-08 00:42:02,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6427ff11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:42:02, skipping insertion in model container [2025-03-08 00:42:02,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:42:02" (2/3) ... [2025-03-08 00:42:02,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6427ff11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:42:02, skipping insertion in model container [2025-03-08 00:42:02,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:42:02" (3/3) ... [2025-03-08 00:42:02,916 INFO L128 eAbstractionObserver]: Analyzing ICFG array_tiling_tcpy.c [2025-03-08 00:42:02,930 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:42:02,934 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_tiling_tcpy.c that has 2 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:42:02,981 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:42:02,992 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;@b7bdea0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:42:02,992 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:42:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:42:03,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:03,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:03,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:03,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1894422990, now seen corresponding path program 1 times [2025-03-08 00:42:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:03,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472186277] [2025-03-08 00:42:03,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:03,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:03,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:42:03,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:42:03,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:03,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:03,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:42:03,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:03,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472186277] [2025-03-08 00:42:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472186277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:03,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627244240] [2025-03-08 00:42:03,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:03,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:03,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:03,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:03,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:42:03,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:42:03,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:42:03,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:03,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:03,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 00:42:03,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:42:03,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:42:03,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627244240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:42:03,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:42:03,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 00:42:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005651087] [2025-03-08 00:42:03,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:42:03,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:42:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:03,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:42:03,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:42:03,244 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:03,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:03,252 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2025-03-08 00:42:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:42:03,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2025-03-08 00:42:03,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:03,256 INFO L225 Difference]: With dead ends: 33 [2025-03-08 00:42:03,257 INFO L226 Difference]: Without dead ends: 15 [2025-03-08 00:42:03,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:42:03,260 INFO L435 NwaCegarLoop]: 20 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, 20 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-08 00:42:03,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:42:03,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-08 00:42:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-08 00:42:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:03,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2025-03-08 00:42:03,279 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 17 [2025-03-08 00:42:03,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:03,280 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2025-03-08 00:42:03,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:03,280 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2025-03-08 00:42:03,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:42:03,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:03,281 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:03,287 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-08 00:42:03,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 00:42:03,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash -445015662, now seen corresponding path program 1 times [2025-03-08 00:42:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971605470] [2025-03-08 00:42:03,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:03,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:42:03,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:42:03,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:03,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:03,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971605470] [2025-03-08 00:42:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971605470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:42:03,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:42:03,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:42:03,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643157032] [2025-03-08 00:42:03,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:42:03,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:42:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:03,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:42:03,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:42:03,629 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:03,649 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2025-03-08 00:42:03,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:42:03,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2025-03-08 00:42:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:03,650 INFO L225 Difference]: With dead ends: 27 [2025-03-08 00:42:03,650 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:42:03,650 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-08 00:42:03,650 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:03,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 27 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:42:03,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:42:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2025-03-08 00:42:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2025-03-08 00:42:03,654 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 17 [2025-03-08 00:42:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:03,654 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2025-03-08 00:42:03,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:03,655 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2025-03-08 00:42:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:42:03,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:03,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:03,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:42:03,655 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:03,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -909628359, now seen corresponding path program 1 times [2025-03-08 00:42:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:03,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107625263] [2025-03-08 00:42:03,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:03,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:03,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:42:03,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:42:03,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:03,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:04,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:04,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107625263] [2025-03-08 00:42:04,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107625263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:04,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966417020] [2025-03-08 00:42:04,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:04,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:04,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:04,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:04,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:42:04,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:42:04,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:42:04,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:04,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:04,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:42:04,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:04,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:04,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966417020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:04,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:04,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2025-03-08 00:42:04,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934768160] [2025-03-08 00:42:04,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:42:04,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:04,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:42:04,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:42:04,255 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:04,430 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-08 00:42:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:42:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2025-03-08 00:42:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:04,431 INFO L225 Difference]: With dead ends: 30 [2025-03-08 00:42:04,431 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:42:04,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:42:04,433 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:04,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 63 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:42:04,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2025-03-08 00:42:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2025-03-08 00:42:04,439 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 18 [2025-03-08 00:42:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:04,439 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2025-03-08 00:42:04,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:04,439 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2025-03-08 00:42:04,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:42:04,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:04,440 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:04,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:04,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:42:04,645 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:04,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1253669571, now seen corresponding path program 1 times [2025-03-08 00:42:04,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:04,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485359984] [2025-03-08 00:42:04,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:04,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:04,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:42:04,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:42:04,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:04,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485359984] [2025-03-08 00:42:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485359984] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045919040] [2025-03-08 00:42:04,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:42:04,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:04,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:04,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:04,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:42:04,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:42:04,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:42:04,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:04,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:04,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 00:42:04,966 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:05,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-08 00:42:05,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:05,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:05,219 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 41 treesize of output 39 [2025-03-08 00:42:05,223 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 94 treesize of output 90 [2025-03-08 00:42:05,227 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 44 treesize of output 32 [2025-03-08 00:42:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:05,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045919040] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:05,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:05,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 8] total 20 [2025-03-08 00:42:05,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756810012] [2025-03-08 00:42:05,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:05,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:42:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:05,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:42:05,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-08 00:42:05,287 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:05,450 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-08 00:42:05,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:42:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 22 [2025-03-08 00:42:05,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:05,452 INFO L225 Difference]: With dead ends: 25 [2025-03-08 00:42:05,452 INFO L226 Difference]: Without dead ends: 23 [2025-03-08 00:42:05,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:42:05,452 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 31 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:05,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 98 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-08 00:42:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2025-03-08 00:42:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-08 00:42:05,461 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 22 [2025-03-08 00:42:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-08 00:42:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 19 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-08 00:42:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:42:05,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:05,463 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:05,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:42:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:05,664 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 966293138, now seen corresponding path program 2 times [2025-03-08 00:42:05,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:05,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819813145] [2025-03-08 00:42:05,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:05,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:42:05,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:42:05,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:05,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:06,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819813145] [2025-03-08 00:42:06,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819813145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:06,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725826367] [2025-03-08 00:42:06,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:06,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:06,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:06,086 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-08 00:42:06,087 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-08 00:42:06,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-08 00:42:06,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:42:06,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:06,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:06,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 00:42:06,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:06,175 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 35 treesize of output 20 [2025-03-08 00:42:06,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:06,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:06,420 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:06,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 28 [2025-03-08 00:42:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:06,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725826367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:06,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:06,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-03-08 00:42:06,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501723560] [2025-03-08 00:42:06,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:06,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:42:06,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:06,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:42:06,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:42:06,462 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:06,910 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2025-03-08 00:42:06,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-08 00:42:06,911 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-08 00:42:06,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:06,911 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:42:06,912 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 00:42:06,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:42:06,913 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 83 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:06,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 170 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 00:42:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 27. [2025-03-08 00:42:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:06,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-08 00:42:06,917 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 25 [2025-03-08 00:42:06,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:06,917 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-08 00:42:06,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.76) internal successors, (44), 24 states have internal predecessors, (44), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-08 00:42:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:42:06,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:06,922 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:06,927 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-08 00:42:07,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:07,122 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:07,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:07,123 INFO L85 PathProgramCache]: Analyzing trace with hash 28830578, now seen corresponding path program 3 times [2025-03-08 00:42:07,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:07,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096604130] [2025-03-08 00:42:07,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:07,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-08 00:42:07,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:42:07,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:42:07,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:07,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096604130] [2025-03-08 00:42:07,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096604130] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:07,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513309338] [2025-03-08 00:42:07,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:07,559 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-08 00:42:07,561 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-08 00:42:07,606 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 3 equivalence classes. [2025-03-08 00:42:07,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:42:07,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:42:07,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:07,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:42:07,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:07,699 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 30 treesize of output 11 [2025-03-08 00:42:07,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:07,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2025-03-08 00:42:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:07,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:08,019 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 59 treesize of output 57 [2025-03-08 00:42:08,027 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 2862 treesize of output 2830 [2025-03-08 00:42:08,046 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 288 treesize of output 204 [2025-03-08 00:42:08,177 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:08,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513309338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:08,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:08,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-08 00:42:08,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654551813] [2025-03-08 00:42:08,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:08,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-08 00:42:08,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:08,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-08 00:42:08,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2025-03-08 00:42:08,181 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:08,367 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2025-03-08 00:42:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:42:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-08 00:42:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:08,368 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:42:08,370 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 00:42:08,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:42:08,371 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 38 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:08,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 267 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 00:42:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 25. [2025-03-08 00:42:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2025-03-08 00:42:08,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2025-03-08 00:42:08,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:08,376 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2025-03-08 00:42:08,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:08,376 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2025-03-08 00:42:08,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:42:08,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:08,377 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:08,383 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-08 00:42:08,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:08,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:08,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1968933149, now seen corresponding path program 4 times [2025-03-08 00:42:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:08,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837520389] [2025-03-08 00:42:08,578 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:08,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:08,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:42:08,595 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:42:08,597 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:08,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:08,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837520389] [2025-03-08 00:42:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837520389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54761164] [2025-03-08 00:42:08,952 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:08,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:08,954 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-08 00:42:08,955 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-08 00:42:08,992 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-08 00:42:09,014 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:42:09,014 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:09,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:09,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 00:42:09,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:09,043 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 30 treesize of output 19 [2025-03-08 00:42:09,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:09,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:09,231 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:09,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:09,375 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:09,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 44 [2025-03-08 00:42:09,395 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:09,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54761164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:09,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:09,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-03-08 00:42:09,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889951701] [2025-03-08 00:42:09,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:09,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:42:09,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:09,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:42:09,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:42:09,396 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:09,632 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-03-08 00:42:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:42:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-08 00:42:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:09,633 INFO L225 Difference]: With dead ends: 60 [2025-03-08 00:42:09,635 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 00:42:09,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=734, Unknown=0, NotChecked=0, Total=870 [2025-03-08 00:42:09,636 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 44 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:09,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 230 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 00:42:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 30. [2025-03-08 00:42:09,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:09,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-08 00:42:09,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2025-03-08 00:42:09,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:09,642 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-08 00:42:09,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-08 00:42:09,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:42:09,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:09,643 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:09,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:09,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:09,844 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:09,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash -100833219, now seen corresponding path program 5 times [2025-03-08 00:42:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:09,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640513166] [2025-03-08 00:42:09,844 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:09,852 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-08 00:42:09,860 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:42:09,860 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:42:09,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:10,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:10,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640513166] [2025-03-08 00:42:10,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640513166] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:10,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526418720] [2025-03-08 00:42:10,203 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:10,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:10,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:10,205 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-08 00:42:10,207 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-08 00:42:10,243 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-03-08 00:42:10,270 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:42:10,270 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:42:10,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:10,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 00:42:10,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:10,338 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 30 treesize of output 11 [2025-03-08 00:42:10,500 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:10,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:10,540 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 41 treesize of output 39 [2025-03-08 00:42:10,541 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 94 treesize of output 90 [2025-03-08 00:42:10,543 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 44 treesize of output 32 [2025-03-08 00:42:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526418720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:10,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-08 00:42:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590605756] [2025-03-08 00:42:10,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:10,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 00:42:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:10,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 00:42:10,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-03-08 00:42:10,601 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:10,770 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-03-08 00:42:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:42:10,771 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-08 00:42:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:10,771 INFO L225 Difference]: With dead ends: 50 [2025-03-08 00:42:10,771 INFO L226 Difference]: Without dead ends: 48 [2025-03-08 00:42:10,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:42:10,772 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:10,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 265 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:42:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-08 00:42:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 28. [2025-03-08 00:42:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-03-08 00:42:10,777 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 30 [2025-03-08 00:42:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:10,777 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-03-08 00:42:10,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 26 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-03-08 00:42:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:42:10,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:10,778 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:10,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 00:42:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:10,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:10,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash 119957170, now seen corresponding path program 6 times [2025-03-08 00:42:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:10,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332917348] [2025-03-08 00:42:10,979 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:10,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:10,985 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 5 equivalence classes. [2025-03-08 00:42:10,996 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:42:10,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:42:10,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:11,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332917348] [2025-03-08 00:42:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332917348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:11,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247537928] [2025-03-08 00:42:11,067 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:11,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:11,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:11,069 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-08 00:42:11,070 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-08 00:42:11,105 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 5 equivalence classes. [2025-03-08 00:42:11,157 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:42:11,157 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-08 00:42:11,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:11,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:42:11,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:11,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:11,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247537928] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:11,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:11,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 17 [2025-03-08 00:42:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404863360] [2025-03-08 00:42:11,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:11,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:42:11,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:11,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:42:11,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:42:11,329 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:11,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:11,384 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2025-03-08 00:42:11,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:42:11,388 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-08 00:42:11,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:11,390 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:42:11,390 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 00:42:11,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:42:11,391 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:11,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:42:11,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 00:42:11,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-08 00:42:11,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:11,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-03-08 00:42:11,398 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 31 [2025-03-08 00:42:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:11,398 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-03-08 00:42:11,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-03-08 00:42:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:42:11,399 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:11,399 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:11,405 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-08 00:42:11,599 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,SelfDestructingSolverStorable8 [2025-03-08 00:42:11,600 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:11,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 196069657, now seen corresponding path program 7 times [2025-03-08 00:42:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120661635] [2025-03-08 00:42:11,600 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:11,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 00:42:11,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:42:11,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:11,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:11,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120661635] [2025-03-08 00:42:11,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120661635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:11,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118941115] [2025-03-08 00:42:11,952 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:11,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:11,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:11,953 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-08 00:42:11,955 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-08 00:42:11,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 00:42:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:42:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:12,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 00:42:12,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:12,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2025-03-08 00:42:12,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:12,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:12,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:12,501 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 00:42:12,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 54 [2025-03-08 00:42:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:12,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118941115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:12,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:12,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 33 [2025-03-08 00:42:12,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854164375] [2025-03-08 00:42:12,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:12,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 00:42:12,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:12,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 00:42:12,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 00:42:12,563 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:13,089 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-03-08 00:42:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:42:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2025-03-08 00:42:13,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:13,092 INFO L225 Difference]: With dead ends: 70 [2025-03-08 00:42:13,092 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 00:42:13,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=288, Invalid=1968, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 00:42:13,093 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 84 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:13,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 247 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 00:42:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 34. [2025-03-08 00:42:13,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-08 00:42:13,104 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 32 [2025-03-08 00:42:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:13,104 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-08 00:42:13,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 32 states have internal predecessors, (63), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-08 00:42:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:42:13,105 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:13,105 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:13,112 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-08 00:42:13,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:42:13,310 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:13,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:13,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1609754567, now seen corresponding path program 8 times [2025-03-08 00:42:13,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:13,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276026452] [2025-03-08 00:42:13,311 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:13,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:13,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:42:13,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:42:13,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:13,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:13,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276026452] [2025-03-08 00:42:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276026452] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842995681] [2025-03-08 00:42:13,657 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:13,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:13,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:13,663 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-08 00:42:13,664 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-08 00:42:13,709 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:42:13,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:42:13,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:13,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:13,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 00:42:13,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:13,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-08 00:42:14,065 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-08 00:42:14,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:14,221 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 41 treesize of output 39 [2025-03-08 00:42:14,225 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 214 treesize of output 206 [2025-03-08 00:42:14,228 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 36 treesize of output 24 [2025-03-08 00:42:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:14,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842995681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:14,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:14,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 14] total 38 [2025-03-08 00:42:14,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185026611] [2025-03-08 00:42:14,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:14,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-03-08 00:42:14,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:14,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-03-08 00:42:14,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2025-03-08 00:42:14,364 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 37 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:14,965 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2025-03-08 00:42:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:42:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 37 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-08 00:42:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:14,966 INFO L225 Difference]: With dead ends: 77 [2025-03-08 00:42:14,966 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 00:42:14,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=261, Invalid=2289, Unknown=0, NotChecked=0, Total=2550 [2025-03-08 00:42:14,969 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 104 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:14,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 398 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:14,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 00:42:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 32. [2025-03-08 00:42:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-03-08 00:42:14,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 34 [2025-03-08 00:42:14,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:14,979 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-03-08 00:42:14,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 37 states have internal predecessors, (68), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-03-08 00:42:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 00:42:14,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:14,980 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:14,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:42:15,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:42:15,181 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash -43494090, now seen corresponding path program 9 times [2025-03-08 00:42:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849217034] [2025-03-08 00:42:15,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:15,188 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:42:15,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:42:15,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:42:15,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:15,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849217034] [2025-03-08 00:42:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849217034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590780839] [2025-03-08 00:42:15,652 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:15,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:15,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:15,654 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:15,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:42:15,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 6 equivalence classes. [2025-03-08 00:42:15,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 00:42:15,740 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-08 00:42:15,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:15,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-08 00:42:15,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:15,764 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 30 treesize of output 19 [2025-03-08 00:42:15,799 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:42:15,800 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 1 case distinctions, treesize of input 50 treesize of output 27 [2025-03-08 00:42:15,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:16,185 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:16,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:16,508 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:16,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 71 treesize of output 60 [2025-03-08 00:42:16,539 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:16,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590780839] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:16,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2025-03-08 00:42:16,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096633214] [2025-03-08 00:42:16,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:16,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 00:42:16,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:16,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 00:42:16,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:42:16,540 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:17,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:17,198 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2025-03-08 00:42:17,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:42:17,198 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-08 00:42:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:17,199 INFO L225 Difference]: With dead ends: 78 [2025-03-08 00:42:17,199 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:42:17,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=457, Invalid=1993, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 00:42:17,200 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:17,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 250 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:42:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:42:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2025-03-08 00:42:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2025-03-08 00:42:17,209 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 35 [2025-03-08 00:42:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:17,209 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2025-03-08 00:42:17,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2025-03-08 00:42:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-08 00:42:17,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:17,210 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:17,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:42:17,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:42:17,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:17,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1407398422, now seen corresponding path program 10 times [2025-03-08 00:42:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098648160] [2025-03-08 00:42:17,411 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:17,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:17,417 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:42:17,423 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:42:17,423 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:17,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:17,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098648160] [2025-03-08 00:42:17,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098648160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824073193] [2025-03-08 00:42:17,773 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:17,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:17,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:17,775 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:17,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:42:17,822 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 37 statements into 2 equivalence classes. [2025-03-08 00:42:17,922 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-08 00:42:17,923 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:17,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:17,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-08 00:42:17,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:17,988 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 36 treesize of output 21 [2025-03-08 00:42:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:18,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:18,360 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:18,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 39 treesize of output 28 [2025-03-08 00:42:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:18,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824073193] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:18,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:18,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2025-03-08 00:42:18,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865825375] [2025-03-08 00:42:18,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:18,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 00:42:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:18,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 00:42:18,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1088, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:42:18,374 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:18,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:18,957 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2025-03-08 00:42:18,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:42:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2025-03-08 00:42:18,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:18,958 INFO L225 Difference]: With dead ends: 97 [2025-03-08 00:42:18,958 INFO L226 Difference]: Without dead ends: 95 [2025-03-08 00:42:18,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1948, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:42:18,959 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:18,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 524 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-08 00:42:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 39. [2025-03-08 00:42:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-08 00:42:18,972 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 37 [2025-03-08 00:42:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:18,972 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-08 00:42:18,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:18,972 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-08 00:42:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:42:18,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:18,974 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:18,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:19,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:42:19,175 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:19,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash -830544974, now seen corresponding path program 11 times [2025-03-08 00:42:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:19,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378439200] [2025-03-08 00:42:19,176 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:19,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:19,182 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 7 equivalence classes. [2025-03-08 00:42:19,197 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:42:19,197 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-08 00:42:19,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:19,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378439200] [2025-03-08 00:42:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378439200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270056161] [2025-03-08 00:42:19,606 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:19,608 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:19,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:42:19,655 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 39 statements into 7 equivalence classes. [2025-03-08 00:42:19,685 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:42:19,685 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-08 00:42:19,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:19,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 00:42:19,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:19,735 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 30 treesize of output 19 [2025-03-08 00:42:19,761 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:42:19,761 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 1 case distinctions, treesize of input 50 treesize of output 27 [2025-03-08 00:42:19,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:20,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:20,374 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:20,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 71 treesize of output 60 [2025-03-08 00:42:20,417 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270056161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:20,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:20,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 42 [2025-03-08 00:42:20,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657256495] [2025-03-08 00:42:20,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:20,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:42:20,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:20,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:42:20,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1570, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:42:20,419 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:21,162 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2025-03-08 00:42:21,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-08 00:42:21,163 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-03-08 00:42:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:21,163 INFO L225 Difference]: With dead ends: 104 [2025-03-08 00:42:21,163 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 00:42:21,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=379, Invalid=3281, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 00:42:21,164 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 91 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:21,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 342 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:21,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 00:42:21,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 42. [2025-03-08 00:42:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-08 00:42:21,179 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 39 [2025-03-08 00:42:21,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:21,179 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-08 00:42:21,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-08 00:42:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:42:21,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:21,180 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:21,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-08 00:42:21,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:42:21,381 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash -149268746, now seen corresponding path program 12 times [2025-03-08 00:42:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:21,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758879370] [2025-03-08 00:42:21,382 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:21,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:21,390 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 6 equivalence classes. [2025-03-08 00:42:21,415 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:42:21,417 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:42:21,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758879370] [2025-03-08 00:42:21,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758879370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:21,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969406481] [2025-03-08 00:42:21,810 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:21,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:21,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:21,813 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:21,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:42:21,869 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 6 equivalence classes. [2025-03-08 00:42:21,951 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:42:21,951 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:42:21,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:21,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-08 00:42:21,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:22,059 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 34 treesize of output 13 [2025-03-08 00:42:22,101 INFO L349 Elim1Store]: treesize reduction 67, result has 11.8 percent of original size [2025-03-08 00:42:22,101 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 1 case distinctions, treesize of input 60 treesize of output 17 [2025-03-08 00:42:22,308 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:22,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:22,525 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 59 treesize of output 57 [2025-03-08 00:42:22,528 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 2886 treesize of output 2854 [2025-03-08 00:42:22,541 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 220 treesize of output 160 [2025-03-08 00:42:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:22,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969406481] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:22,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:22,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 46 [2025-03-08 00:42:22,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768192945] [2025-03-08 00:42:22,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:22,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 00:42:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:22,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 00:42:22,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1910, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 00:42:22,678 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 46 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 46 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:23,206 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2025-03-08 00:42:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:42:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 46 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2025-03-08 00:42:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:23,207 INFO L225 Difference]: With dead ends: 84 [2025-03-08 00:42:23,207 INFO L226 Difference]: Without dead ends: 82 [2025-03-08 00:42:23,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=2515, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 00:42:23,208 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 61 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:23,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 555 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-08 00:42:23,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 41. [2025-03-08 00:42:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2025-03-08 00:42:23,221 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 39 [2025-03-08 00:42:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:23,221 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2025-03-08 00:42:23,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.8043478260869565) internal successors, (83), 46 states have internal predecessors, (83), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2025-03-08 00:42:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 00:42:23,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:23,222 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:23,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:23,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:23,422 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:23,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:23,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2139074414, now seen corresponding path program 13 times [2025-03-08 00:42:23,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:23,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246265328] [2025-03-08 00:42:23,423 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:23,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:23,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:42:23,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:42:23,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:23,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:23,840 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:23,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:23,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246265328] [2025-03-08 00:42:23,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246265328] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:23,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568334891] [2025-03-08 00:42:23,840 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:23,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:23,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:23,842 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:23,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-08 00:42:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 00:42:23,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 00:42:23,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:23,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:23,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 00:42:23,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:24,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2025-03-08 00:42:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:24,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:24,610 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 00:42:24,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 35 [2025-03-08 00:42:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:24,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568334891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:24,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:24,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 17] total 48 [2025-03-08 00:42:24,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825315427] [2025-03-08 00:42:24,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:24,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 00:42:24,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:24,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 00:42:24,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2091, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 00:42:24,756 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 48 states, 48 states have (on average 1.875) internal successors, (90), 47 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:25,771 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2025-03-08 00:42:25,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 00:42:25,771 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.875) internal successors, (90), 47 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2025-03-08 00:42:25,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:25,772 INFO L225 Difference]: With dead ends: 125 [2025-03-08 00:42:25,772 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 00:42:25,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1249 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=527, Invalid=5325, Unknown=0, NotChecked=0, Total=5852 [2025-03-08 00:42:25,773 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 163 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:25,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 540 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 00:42:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 43. [2025-03-08 00:42:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2025-03-08 00:42:25,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 41 [2025-03-08 00:42:25,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:25,789 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2025-03-08 00:42:25,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.875) internal successors, (90), 47 states have internal predecessors, (90), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:25,789 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2025-03-08 00:42:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:42:25,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:25,789 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:25,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-08 00:42:25,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 00:42:25,990 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:25,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 542148605, now seen corresponding path program 14 times [2025-03-08 00:42:25,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:25,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186816218] [2025-03-08 00:42:25,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:25,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:25,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 00:42:26,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:42:26,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:26,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186816218] [2025-03-08 00:42:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186816218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885362422] [2025-03-08 00:42:26,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:26,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:26,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:26,604 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:26,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-08 00:42:26,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-08 00:42:26,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:42:26,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:26,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:26,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-08 00:42:26,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:26,702 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 32 treesize of output 21 [2025-03-08 00:42:26,726 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-08 00:42:26,726 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 1 case distinctions, treesize of input 58 treesize of output 29 [2025-03-08 00:42:26,746 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 62 treesize of output 29 [2025-03-08 00:42:26,775 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-08 00:42:26,775 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 1 case distinctions, treesize of input 58 treesize of output 25 [2025-03-08 00:42:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:27,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:27,349 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:27,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 76 [2025-03-08 00:42:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:27,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885362422] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:27,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:27,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 42 [2025-03-08 00:42:27,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896519349] [2025-03-08 00:42:27,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:27,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:42:27,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:27,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:42:27,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1556, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:42:27,357 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 42 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:29,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:29,159 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2025-03-08 00:42:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 00:42:29,159 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-08 00:42:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:29,159 INFO L225 Difference]: With dead ends: 140 [2025-03-08 00:42:29,159 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 00:42:29,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1481 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=711, Invalid=4839, Unknown=0, NotChecked=0, Total=5550 [2025-03-08 00:42:29,161 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 140 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:29,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 488 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:29,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 00:42:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 46. [2025-03-08 00:42:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-08 00:42:29,180 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 42 [2025-03-08 00:42:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:29,180 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-08 00:42:29,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.1666666666666665) internal successors, (91), 42 states have internal predecessors, (91), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-08 00:42:29,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-08 00:42:29,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:29,181 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:29,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:29,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 00:42:29,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:29,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:29,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1210448526, now seen corresponding path program 15 times [2025-03-08 00:42:29,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:29,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604417987] [2025-03-08 00:42:29,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:29,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:29,391 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 7 equivalence classes. [2025-03-08 00:42:29,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:42:29,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:42:29,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604417987] [2025-03-08 00:42:29,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604417987] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816769920] [2025-03-08 00:42:29,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:29,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:29,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:29,845 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:29,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-08 00:42:29,904 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 7 equivalence classes. [2025-03-08 00:42:30,357 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 43 of 43 statements. [2025-03-08 00:42:30,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:42:30,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:30,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-08 00:42:30,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:30,491 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 30 treesize of output 11 [2025-03-08 00:42:30,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:30,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:30,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 15 [2025-03-08 00:42:30,801 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:30,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:31,056 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 59 treesize of output 57 [2025-03-08 00:42:31,068 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 6710 treesize of output 6646 [2025-03-08 00:42:31,075 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 183 treesize of output 135 [2025-03-08 00:42:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:31,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816769920] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:31,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:31,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 52 [2025-03-08 00:42:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815631332] [2025-03-08 00:42:31,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:31,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-08 00:42:31,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:31,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-08 00:42:31,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2445, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 00:42:31,232 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 52 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:31,634 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2025-03-08 00:42:31,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-08 00:42:31,634 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 52 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2025-03-08 00:42:31,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:31,635 INFO L225 Difference]: With dead ends: 115 [2025-03-08 00:42:31,635 INFO L226 Difference]: Without dead ends: 113 [2025-03-08 00:42:31,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=2536, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 00:42:31,637 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 50 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:31,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 623 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:42:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-08 00:42:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 44. [2025-03-08 00:42:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2025-03-08 00:42:31,660 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 43 [2025-03-08 00:42:31,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:31,660 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2025-03-08 00:42:31,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 52 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2025-03-08 00:42:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:42:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:31,661 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:31,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-08 00:42:31,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 00:42:31,862 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:31,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:31,862 INFO L85 PathProgramCache]: Analyzing trace with hash -735219939, now seen corresponding path program 16 times [2025-03-08 00:42:31,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:31,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295214116] [2025-03-08 00:42:31,862 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:31,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:31,875 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:42:31,893 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:42:31,893 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:31,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:32,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295214116] [2025-03-08 00:42:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295214116] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414592641] [2025-03-08 00:42:32,298 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:32,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:32,300 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:32,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-08 00:42:32,359 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-03-08 00:42:32,604 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-03-08 00:42:32,604 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:32,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:32,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-08 00:42:32,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:32,682 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 35 treesize of output 20 [2025-03-08 00:42:32,713 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-08 00:42:32,713 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 1 case distinctions, treesize of input 57 treesize of output 24 [2025-03-08 00:42:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:33,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:33,146 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:33,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 44 [2025-03-08 00:42:33,239 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:33,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414592641] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:33,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 42 [2025-03-08 00:42:33,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972424210] [2025-03-08 00:42:33,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:33,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 00:42:33,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:33,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 00:42:33,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1587, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:42:33,241 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 42 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:34,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:34,141 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2025-03-08 00:42:34,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 00:42:34,142 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 44 [2025-03-08 00:42:34,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:34,142 INFO L225 Difference]: With dead ends: 121 [2025-03-08 00:42:34,143 INFO L226 Difference]: Without dead ends: 119 [2025-03-08 00:42:34,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 787 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=353, Invalid=4203, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 00:42:34,144 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 85 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:34,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 690 Invalid, 1166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:34,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-08 00:42:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 46. [2025-03-08 00:42:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:34,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2025-03-08 00:42:34,175 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 44 [2025-03-08 00:42:34,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:34,175 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2025-03-08 00:42:34,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 42 states have internal predecessors, (80), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:34,175 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2025-03-08 00:42:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:42:34,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:34,176 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:34,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-08 00:42:34,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:34,376 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:34,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:34,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2108940807, now seen corresponding path program 17 times [2025-03-08 00:42:34,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:34,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987792603] [2025-03-08 00:42:34,377 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:34,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:34,383 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 9 equivalence classes. [2025-03-08 00:42:34,403 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:42:34,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:42:34,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:35,188 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:35,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987792603] [2025-03-08 00:42:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987792603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:35,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755255205] [2025-03-08 00:42:35,188 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:35,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:35,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:35,190 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:35,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-08 00:42:35,252 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 9 equivalence classes. [2025-03-08 00:42:35,301 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:42:35,302 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2025-03-08 00:42:35,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:35,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-08 00:42:35,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:35,352 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 30 treesize of output 19 [2025-03-08 00:42:35,403 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:42:35,403 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 1 case distinctions, treesize of input 50 treesize of output 27 [2025-03-08 00:42:35,441 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 54 treesize of output 27 [2025-03-08 00:42:35,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:35,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:35,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:36,357 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:36,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 87 treesize of output 76 [2025-03-08 00:42:36,407 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:36,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755255205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:36,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:36,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2025-03-08 00:42:36,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356733094] [2025-03-08 00:42:36,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:36,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-08 00:42:36,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:36,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-08 00:42:36,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=2469, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 00:42:36,409 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 52 states, 52 states have (on average 2.0) internal successors, (104), 52 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:37,607 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2025-03-08 00:42:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-08 00:42:37,607 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 52 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-03-08 00:42:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:37,608 INFO L225 Difference]: With dead ends: 128 [2025-03-08 00:42:37,608 INFO L226 Difference]: Without dead ends: 126 [2025-03-08 00:42:37,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=4947, Unknown=0, NotChecked=0, Total=5402 [2025-03-08 00:42:37,609 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 126 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:37,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 581 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:42:37,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-08 00:42:37,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 49. [2025-03-08 00:42:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-08 00:42:37,633 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2025-03-08 00:42:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:37,633 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-08 00:42:37,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0) internal successors, (104), 52 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-08 00:42:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:42:37,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:37,634 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:37,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-08 00:42:37,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:37,834 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:37,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:37,835 INFO L85 PathProgramCache]: Analyzing trace with hash 74255933, now seen corresponding path program 18 times [2025-03-08 00:42:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:37,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216465497] [2025-03-08 00:42:37,835 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:37,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:37,842 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 8 equivalence classes. [2025-03-08 00:42:37,855 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:42:37,855 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:42:37,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216465497] [2025-03-08 00:42:38,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216465497] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:38,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127998926] [2025-03-08 00:42:38,286 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:42:38,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:38,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:38,288 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:38,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-08 00:42:38,358 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 46 statements into 8 equivalence classes. [2025-03-08 00:42:38,652 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:42:38,652 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:42:38,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:38,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 00:42:38,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:38,784 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 34 treesize of output 13 [2025-03-08 00:42:39,074 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:39,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:39,355 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 41 treesize of output 39 [2025-03-08 00:42:39,356 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 214 treesize of output 206 [2025-03-08 00:42:39,358 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 36 treesize of output 24 [2025-03-08 00:42:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:39,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127998926] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:39,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2025-03-08 00:42:39,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897927714] [2025-03-08 00:42:39,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:39,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 00:42:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:39,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 00:42:39,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2792, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 00:42:39,592 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 55 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 55 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:40,473 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2025-03-08 00:42:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:42:40,473 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 55 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2025-03-08 00:42:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:40,474 INFO L225 Difference]: With dead ends: 104 [2025-03-08 00:42:40,474 INFO L226 Difference]: Without dead ends: 102 [2025-03-08 00:42:40,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=343, Invalid=4913, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 00:42:40,475 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 75 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:40,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 897 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:40,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-08 00:42:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 48. [2025-03-08 00:42:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2025-03-08 00:42:40,502 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 46 [2025-03-08 00:42:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:40,502 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2025-03-08 00:42:40,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 55 states have internal predecessors, (104), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:40,502 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2025-03-08 00:42:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:42:40,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:40,503 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:40,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-08 00:42:40,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-08 00:42:40,703 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:40,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:40,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1591708391, now seen corresponding path program 19 times [2025-03-08 00:42:40,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:40,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728482372] [2025-03-08 00:42:40,704 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:40,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:40,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:42:40,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:42:40,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:40,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:41,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:41,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728482372] [2025-03-08 00:42:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728482372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:41,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934985185] [2025-03-08 00:42:41,218 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:42:41,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:41,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:41,220 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:41,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-08 00:42:41,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-08 00:42:41,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:42:41,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:42:41,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:41,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 00:42:41,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:41,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2025-03-08 00:42:41,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:41,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:41,926 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 131 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:41,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:42,238 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 00:42:42,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 60 treesize of output 50 [2025-03-08 00:42:42,415 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:42,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934985185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:42,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:42,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23, 20] total 57 [2025-03-08 00:42:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928647661] [2025-03-08 00:42:42,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:42,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-08 00:42:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:42,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-08 00:42:42,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2990, Unknown=0, NotChecked=0, Total=3192 [2025-03-08 00:42:42,416 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 57 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:43,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:43,711 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2025-03-08 00:42:43,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 00:42:43,711 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 48 [2025-03-08 00:42:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:43,712 INFO L225 Difference]: With dead ends: 149 [2025-03-08 00:42:43,712 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 00:42:43,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=622, Invalid=7388, Unknown=0, NotChecked=0, Total=8010 [2025-03-08 00:42:43,713 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 168 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:43,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 662 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 00:42:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 50. [2025-03-08 00:42:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-08 00:42:43,742 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 48 [2025-03-08 00:42:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:43,743 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-08 00:42:43,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 56 states have internal predecessors, (111), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-08 00:42:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-08 00:42:43,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:43,743 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:43,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-08 00:42:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-08 00:42:43,944 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:43,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:43,944 INFO L85 PathProgramCache]: Analyzing trace with hash -673098666, now seen corresponding path program 20 times [2025-03-08 00:42:43,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:43,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516096462] [2025-03-08 00:42:43,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:43,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:43,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:42:43,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:42:43,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:43,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:44,653 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 84 proven. 57 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:44,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516096462] [2025-03-08 00:42:44,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516096462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:44,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928066065] [2025-03-08 00:42:44,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:42:44,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:44,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:44,655 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:44,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-08 00:42:44,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-08 00:42:44,765 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-08 00:42:44,765 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:42:44,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:44,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 00:42:44,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:44,820 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 32 treesize of output 21 [2025-03-08 00:42:44,851 INFO L349 Elim1Store]: treesize reduction 28, result has 30.0 percent of original size [2025-03-08 00:42:44,851 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 1 case distinctions, treesize of input 58 treesize of output 25 [2025-03-08 00:42:44,879 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 58 treesize of output 25 [2025-03-08 00:42:44,908 INFO L349 Elim1Store]: treesize reduction 24, result has 40.0 percent of original size [2025-03-08 00:42:44,909 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 1 case distinctions, treesize of input 58 treesize of output 29 [2025-03-08 00:42:44,936 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 58 treesize of output 25 [2025-03-08 00:42:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:45,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:45,749 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 00:42:45,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 117 treesize of output 107 [2025-03-08 00:42:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:45,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928066065] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:45,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:45,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 19] total 55 [2025-03-08 00:42:45,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437282669] [2025-03-08 00:42:45,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:45,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-08 00:42:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:45,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-08 00:42:45,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=2726, Unknown=0, NotChecked=0, Total=2970 [2025-03-08 00:42:45,788 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:47,944 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2025-03-08 00:42:47,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-08 00:42:47,945 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2025-03-08 00:42:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:47,945 INFO L225 Difference]: With dead ends: 155 [2025-03-08 00:42:47,945 INFO L226 Difference]: Without dead ends: 120 [2025-03-08 00:42:47,946 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2322 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=952, Invalid=7978, Unknown=0, NotChecked=0, Total=8930 [2025-03-08 00:42:47,946 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 266 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:47,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 520 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:47,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-08 00:42:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 53. [2025-03-08 00:42:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2025-03-08 00:42:47,986 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 49 [2025-03-08 00:42:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:47,986 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2025-03-08 00:42:47,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2025-03-08 00:42:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 00:42:47,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:47,987 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:47,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-08 00:42:48,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:48,187 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:48,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:48,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1547404345, now seen corresponding path program 21 times [2025-03-08 00:42:48,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:48,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766010871] [2025-03-08 00:42:48,188 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:48,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:48,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 9 equivalence classes. [2025-03-08 00:42:48,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:42:48,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 00:42:48,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:48,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:48,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766010871] [2025-03-08 00:42:48,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766010871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:48,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816920498] [2025-03-08 00:42:48,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:42:48,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:48,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:48,649 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:48,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-08 00:42:48,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 9 equivalence classes. [2025-03-08 00:42:49,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 00:42:49,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-08 00:42:49,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:49,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 00:42:49,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:49,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-08 00:42:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:42:50,231 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:50,528 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 41 treesize of output 39 [2025-03-08 00:42:50,530 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 214 treesize of output 206 [2025-03-08 00:42:50,532 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 36 treesize of output 24 [2025-03-08 00:42:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816920498] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:50,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 22] total 62 [2025-03-08 00:42:50,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360574499] [2025-03-08 00:42:50,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:50,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-08 00:42:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:50,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-08 00:42:50,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3562, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 00:42:50,788 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 61 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:51,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:51,595 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2025-03-08 00:42:51,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:42:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 61 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 50 [2025-03-08 00:42:51,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:51,596 INFO L225 Difference]: With dead ends: 114 [2025-03-08 00:42:51,596 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 00:42:51,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 980 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=347, Invalid=4909, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 00:42:51,597 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 82 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:51,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 793 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:51,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 00:42:51,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 52. [2025-03-08 00:42:51,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:51,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-03-08 00:42:51,632 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 50 [2025-03-08 00:42:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:51,632 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-03-08 00:42:51,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 61 states have internal predecessors, (116), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:42:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-03-08 00:42:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 00:42:51,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:51,632 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:51,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:51,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:51,833 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:51,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2051583459, now seen corresponding path program 22 times [2025-03-08 00:42:51,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:51,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544088731] [2025-03-08 00:42:51,833 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:51,841 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-08 00:42:51,848 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:42:51,848 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:51,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544088731] [2025-03-08 00:42:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544088731] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905963934] [2025-03-08 00:42:52,377 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:42:52,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:52,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:52,380 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:52,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-08 00:42:52,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-08 00:42:52,660 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 00:42:52,661 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:42:52,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:52,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 00:42:52,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:52,799 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 30 treesize of output 19 [2025-03-08 00:42:52,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:42:52,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:53,210 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:53,581 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:53,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 44 [2025-03-08 00:42:53,756 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:53,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905963934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:53,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:53,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2025-03-08 00:42:53,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427508417] [2025-03-08 00:42:53,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:53,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-08 00:42:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:53,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-08 00:42:53,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3440, Unknown=0, NotChecked=0, Total=3660 [2025-03-08 00:42:53,758 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 61 states, 61 states have (on average 2.0) internal successors, (122), 61 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:42:55,065 INFO L93 Difference]: Finished difference Result 147 states and 154 transitions. [2025-03-08 00:42:55,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-08 00:42:55,065 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.0) internal successors, (122), 61 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-03-08 00:42:55,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:42:55,066 INFO L225 Difference]: With dead ends: 147 [2025-03-08 00:42:55,066 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 00:42:55,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=492, Invalid=6818, Unknown=0, NotChecked=0, Total=7310 [2025-03-08 00:42:55,067 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 155 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:42:55,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 928 Invalid, 1766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:42:55,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 00:42:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 54. [2025-03-08 00:42:55,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:42:55,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2025-03-08 00:42:55,106 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 52 [2025-03-08 00:42:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:42:55,106 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2025-03-08 00:42:55,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.0) internal successors, (122), 61 states have internal predecessors, (122), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:42:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2025-03-08 00:42:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:42:55,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:42:55,106 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:42:55,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-03-08 00:42:55,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-08 00:42:55,307 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:42:55,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:42:55,307 INFO L85 PathProgramCache]: Analyzing trace with hash -482830126, now seen corresponding path program 23 times [2025-03-08 00:42:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:42:55,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523030812] [2025-03-08 00:42:55,307 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:55,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:42:55,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 11 equivalence classes. [2025-03-08 00:42:55,326 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:42:55,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 00:42:55,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:56,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:42:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523030812] [2025-03-08 00:42:56,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523030812] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:42:56,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676524588] [2025-03-08 00:42:56,131 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:42:56,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:42:56,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:42:56,133 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:42:56,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-08 00:42:56,224 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 53 statements into 11 equivalence classes. [2025-03-08 00:42:56,325 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:42:56,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-08 00:42:56,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:42:56,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 00:42:56,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:42:56,372 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 30 treesize of output 19 [2025-03-08 00:42:56,407 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:42:56,407 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 1 case distinctions, treesize of input 50 treesize of output 27 [2025-03-08 00:42:56,440 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 54 treesize of output 27 [2025-03-08 00:42:56,481 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:42:56,481 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 1 case distinctions, treesize of input 54 treesize of output 31 [2025-03-08 00:42:56,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:42:56,980 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:56,981 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:42:57,616 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:42:57,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 103 treesize of output 92 [2025-03-08 00:42:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:42:57,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676524588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:42:57,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:42:57,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 60 [2025-03-08 00:42:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100595766] [2025-03-08 00:42:57,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:42:57,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-08 00:42:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:42:57,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-08 00:42:57,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3334, Unknown=0, NotChecked=0, Total=3540 [2025-03-08 00:42:57,677 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:00,133 INFO L93 Difference]: Finished difference Result 186 states and 194 transitions. [2025-03-08 00:43:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-08 00:43:00,134 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2025-03-08 00:43:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:00,135 INFO L225 Difference]: With dead ends: 186 [2025-03-08 00:43:00,135 INFO L226 Difference]: Without dead ends: 184 [2025-03-08 00:43:00,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=703, Invalid=8999, Unknown=0, NotChecked=0, Total=9702 [2025-03-08 00:43:00,136 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 226 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:00,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 774 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:43:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-08 00:43:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 57. [2025-03-08 00:43:00,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:43:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2025-03-08 00:43:00,189 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 53 [2025-03-08 00:43:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2025-03-08 00:43:00,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 states have internal predecessors, (125), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2025-03-08 00:43:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-08 00:43:00,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:00,189 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:00,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-08 00:43:00,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 00:43:00,390 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:00,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash 276156733, now seen corresponding path program 24 times [2025-03-08 00:43:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50094678] [2025-03-08 00:43:00,390 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:00,398 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 10 equivalence classes. [2025-03-08 00:43:00,413 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:43:00,413 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-08 00:43:00,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:00,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:00,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50094678] [2025-03-08 00:43:00,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50094678] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:00,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927352832] [2025-03-08 00:43:00,900 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:00,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:00,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:00,902 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:00,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-08 00:43:00,996 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 10 equivalence classes. [2025-03-08 00:43:01,479 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) and asserted 54 of 54 statements. [2025-03-08 00:43:01,479 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2025-03-08 00:43:01,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:01,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-08 00:43:01,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:01,683 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 30 treesize of output 11 [2025-03-08 00:43:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:02,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:02,435 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 41 treesize of output 39 [2025-03-08 00:43:02,436 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 214 treesize of output 206 [2025-03-08 00:43:02,438 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 36 treesize of output 24 [2025-03-08 00:43:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 181 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927352832] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:02,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:02,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 67 [2025-03-08 00:43:02,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319692641] [2025-03-08 00:43:02,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:02,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-03-08 00:43:02,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:02,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-03-08 00:43:02,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4163, Unknown=0, NotChecked=0, Total=4422 [2025-03-08 00:43:02,694 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 67 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 67 states have internal predecessors, (128), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:03,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:03,413 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2025-03-08 00:43:03,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:43:03,414 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 67 states have internal predecessors, (128), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 54 [2025-03-08 00:43:03,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:03,415 INFO L225 Difference]: With dead ends: 124 [2025-03-08 00:43:03,415 INFO L226 Difference]: Without dead ends: 122 [2025-03-08 00:43:03,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=272, Invalid=4284, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 00:43:03,416 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 1068 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 2117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:03,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1102 Invalid, 2117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:43:03,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-08 00:43:03,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 56. [2025-03-08 00:43:03,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:43:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2025-03-08 00:43:03,470 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 54 [2025-03-08 00:43:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:03,470 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2025-03-08 00:43:03,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.9104477611940298) internal successors, (128), 67 states have internal predecessors, (128), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:03,470 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2025-03-08 00:43:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:43:03,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:03,470 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:03,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-08 00:43:03,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-08 00:43:03,671 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:03,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:03,671 INFO L85 PathProgramCache]: Analyzing trace with hash -145932579, now seen corresponding path program 25 times [2025-03-08 00:43:03,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:03,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061056206] [2025-03-08 00:43:03,672 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:43:03,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:03,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 00:43:03,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:43:03,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:04,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061056206] [2025-03-08 00:43:04,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061056206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:04,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129500655] [2025-03-08 00:43:04,415 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:43:04,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:04,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:04,417 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:04,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-03-08 00:43:04,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-08 00:43:04,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:43:04,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:04,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:04,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-08 00:43:04,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:04,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2025-03-08 00:43:04,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:43:04,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:43:04,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:43:04,796 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:43:04,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 27 [2025-03-08 00:43:04,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 27 [2025-03-08 00:43:04,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:43:04,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:43:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 211 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:43:05,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:06,106 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 00:43:06,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 136 treesize of output 126 [2025-03-08 00:43:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:06,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129500655] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:06,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:06,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 22] total 63 [2025-03-08 00:43:06,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013638] [2025-03-08 00:43:06,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:06,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-08 00:43:06,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:06,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-08 00:43:06,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=3671, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 00:43:06,149 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 63 states, 63 states have (on average 2.142857142857143) internal successors, (135), 62 states have internal predecessors, (135), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:43:08,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:08,036 INFO L93 Difference]: Finished difference Result 142 states and 147 transitions. [2025-03-08 00:43:08,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 00:43:08,037 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.142857142857143) internal successors, (135), 62 states have internal predecessors, (135), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-03-08 00:43:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:08,037 INFO L225 Difference]: With dead ends: 142 [2025-03-08 00:43:08,037 INFO L226 Difference]: Without dead ends: 140 [2025-03-08 00:43:08,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1903 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=701, Invalid=8419, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 00:43:08,038 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 173 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:08,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 657 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:43:08,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-08 00:43:08,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 59. [2025-03-08 00:43:08,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:43:08,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-03-08 00:43:08,099 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 56 [2025-03-08 00:43:08,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:08,099 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-03-08 00:43:08,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.142857142857143) internal successors, (135), 62 states have internal predecessors, (135), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:43:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-03-08 00:43:08,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-08 00:43:08,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:08,099 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:08,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-03-08 00:43:08,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 00:43:08,303 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:08,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:08,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1766040807, now seen corresponding path program 26 times [2025-03-08 00:43:08,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:08,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335352910] [2025-03-08 00:43:08,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:43:08,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:08,312 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:43:08,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:43:08,319 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:43:08,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:08,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335352910] [2025-03-08 00:43:08,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335352910] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:08,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043779162] [2025-03-08 00:43:08,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:43:08,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:08,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:08,898 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:08,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-03-08 00:43:09,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-03-08 00:43:09,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-03-08 00:43:09,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:43:09,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:09,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 00:43:09,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:09,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2025-03-08 00:43:09,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:43:09,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:43:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:43:09,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:10,267 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2025-03-08 00:43:10,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 54 [2025-03-08 00:43:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:10,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043779162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:10,560 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:10,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 24] total 69 [2025-03-08 00:43:10,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002540349] [2025-03-08 00:43:10,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:10,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-08 00:43:10,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:10,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-08 00:43:10,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=4440, Unknown=0, NotChecked=0, Total=4692 [2025-03-08 00:43:10,561 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 69 states, 69 states have (on average 1.9710144927536233) internal successors, (136), 68 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:43:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:12,958 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2025-03-08 00:43:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-08 00:43:12,958 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.9710144927536233) internal successors, (136), 68 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2025-03-08 00:43:12,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:12,959 INFO L225 Difference]: With dead ends: 208 [2025-03-08 00:43:12,959 INFO L226 Difference]: Without dead ends: 206 [2025-03-08 00:43:12,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3279 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=887, Invalid=13155, Unknown=0, NotChecked=0, Total=14042 [2025-03-08 00:43:12,960 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 428 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:12,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 972 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:43:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-08 00:43:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 61. [2025-03-08 00:43:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:43:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2025-03-08 00:43:13,051 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 56 [2025-03-08 00:43:13,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:13,051 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2025-03-08 00:43:13,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.9710144927536233) internal successors, (136), 68 states have internal predecessors, (136), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:43:13,051 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2025-03-08 00:43:13,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-08 00:43:13,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:13,052 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:13,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-03-08 00:43:13,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 00:43:13,253 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:13,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:13,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1847178695, now seen corresponding path program 27 times [2025-03-08 00:43:13,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131754342] [2025-03-08 00:43:13,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:43:13,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:13,263 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-03-08 00:43:13,286 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 00:43:13,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 00:43:13,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131754342] [2025-03-08 00:43:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131754342] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151970063] [2025-03-08 00:43:13,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:43:13,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:13,852 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:13,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-03-08 00:43:13,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-03-08 00:43:16,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-03-08 00:43:16,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-08 00:43:16,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:16,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-08 00:43:16,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:17,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 11 [2025-03-08 00:43:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:43:17,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:18,023 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 41 treesize of output 39 [2025-03-08 00:43:18,024 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 214 treesize of output 206 [2025-03-08 00:43:18,027 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 36 treesize of output 24 [2025-03-08 00:43:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:18,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151970063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:18,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:18,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29, 26] total 76 [2025-03-08 00:43:18,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959761523] [2025-03-08 00:43:18,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:18,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2025-03-08 00:43:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:18,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2025-03-08 00:43:18,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=5411, Unknown=0, NotChecked=0, Total=5700 [2025-03-08 00:43:18,420 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand has 76 states, 76 states have (on average 1.881578947368421) internal successors, (143), 75 states have internal predecessors, (143), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:43:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:19,683 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2025-03-08 00:43:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 00:43:19,684 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 76 states have (on average 1.881578947368421) internal successors, (143), 75 states have internal predecessors, (143), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2025-03-08 00:43:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:19,684 INFO L225 Difference]: With dead ends: 134 [2025-03-08 00:43:19,684 INFO L226 Difference]: Without dead ends: 132 [2025-03-08 00:43:19,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=454, Invalid=7378, Unknown=0, NotChecked=0, Total=7832 [2025-03-08 00:43:19,685 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 85 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 2711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:19,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1125 Invalid, 2711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:43:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-08 00:43:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 59. [2025-03-08 00:43:19,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:43:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-03-08 00:43:19,747 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 58 [2025-03-08 00:43:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:19,747 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-03-08 00:43:19,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 1.881578947368421) internal successors, (143), 75 states have internal predecessors, (143), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-08 00:43:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-03-08 00:43:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 00:43:19,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:19,748 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:19,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-03-08 00:43:19,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:19,948 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:19,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:19,949 INFO L85 PathProgramCache]: Analyzing trace with hash -969680654, now seen corresponding path program 28 times [2025-03-08 00:43:19,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:19,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374587490] [2025-03-08 00:43:19,949 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:43:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:19,958 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-08 00:43:19,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:43:19,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:43:19,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 188 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374587490] [2025-03-08 00:43:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374587490] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858503791] [2025-03-08 00:43:20,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:43:20,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:20,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:20,205 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:20,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-03-08 00:43:20,319 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 59 statements into 2 equivalence classes. [2025-03-08 00:43:20,500 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:43:20,500 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:43:20,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:20,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-08 00:43:20,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 222 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:20,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:20,889 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 222 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:20,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858503791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:20,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:20,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 36 [2025-03-08 00:43:20,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757163403] [2025-03-08 00:43:20,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:20,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-08 00:43:20,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:20,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-08 00:43:20,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=914, Unknown=0, NotChecked=0, Total=1260 [2025-03-08 00:43:20,890 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:21,136 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2025-03-08 00:43:21,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 00:43:21,136 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-03-08 00:43:21,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:21,136 INFO L225 Difference]: With dead ends: 122 [2025-03-08 00:43:21,137 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 00:43:21,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 18 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=433, Invalid=1289, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:43:21,137 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 40 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:21,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 159 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:21,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 00:43:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2025-03-08 00:43:21,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:43:21,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2025-03-08 00:43:21,199 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 59 [2025-03-08 00:43:21,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:21,199 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2025-03-08 00:43:21,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.611111111111111) internal successors, (94), 36 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2025-03-08 00:43:21,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-08 00:43:21,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:21,200 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:21,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2025-03-08 00:43:21,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-08 00:43:21,400 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1228571446, now seen corresponding path program 29 times [2025-03-08 00:43:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:21,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813185144] [2025-03-08 00:43:21,401 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:43:21,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:21,410 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 12 equivalence classes. [2025-03-08 00:43:21,424 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:43:21,424 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:43:21,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:22,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:22,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813185144] [2025-03-08 00:43:22,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813185144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:22,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625117164] [2025-03-08 00:43:22,070 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:43:22,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:22,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:22,072 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:22,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-03-08 00:43:22,184 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 59 statements into 12 equivalence classes. [2025-03-08 00:43:22,415 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 00:43:22,415 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-08 00:43:22,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:22,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-08 00:43:22,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:22,625 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 30 treesize of output 19 [2025-03-08 00:43:22,663 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:43:22,663 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 1 case distinctions, treesize of input 50 treesize of output 27 [2025-03-08 00:43:22,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:43:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:23,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:23,825 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:43:23,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 71 treesize of output 60 [2025-03-08 00:43:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:24,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625117164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:24,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:24,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 72 [2025-03-08 00:43:24,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748968251] [2025-03-08 00:43:24,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:24,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-08 00:43:24,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:24,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-08 00:43:24,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=4840, Unknown=0, NotChecked=0, Total=5112 [2025-03-08 00:43:24,054 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 72 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:26,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:26,186 INFO L93 Difference]: Finished difference Result 171 states and 178 transitions. [2025-03-08 00:43:26,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-08 00:43:26,186 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 72 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2025-03-08 00:43:26,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:26,187 INFO L225 Difference]: With dead ends: 171 [2025-03-08 00:43:26,187 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 00:43:26,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2286 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=677, Invalid=9829, Unknown=0, NotChecked=0, Total=10506 [2025-03-08 00:43:26,188 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 194 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:26,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1140 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:43:26,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 00:43:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 61. [2025-03-08 00:43:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:43:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2025-03-08 00:43:26,258 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 59 [2025-03-08 00:43:26,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:26,259 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2025-03-08 00:43:26,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 72 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 00:43:26,259 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2025-03-08 00:43:26,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-08 00:43:26,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:26,259 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:26,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-03-08 00:43:26,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:26,460 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:26,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:26,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1205545689, now seen corresponding path program 30 times [2025-03-08 00:43:26,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:26,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497248365] [2025-03-08 00:43:26,460 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:26,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:26,469 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 13 equivalence classes. [2025-03-08 00:43:26,492 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 00:43:26,493 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-08 00:43:26,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497248365] [2025-03-08 00:43:27,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497248365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:27,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886702966] [2025-03-08 00:43:27,527 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:27,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:27,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:27,529 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:27,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-03-08 00:43:27,644 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 60 statements into 13 equivalence classes. [2025-03-08 00:43:28,535 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 60 of 60 statements. [2025-03-08 00:43:28,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-08 00:43:28,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:28,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 70 conjuncts are in the unsatisfiable core [2025-03-08 00:43:28,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:28,567 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 30 treesize of output 19 [2025-03-08 00:43:28,606 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:43:28,607 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 1 case distinctions, treesize of input 50 treesize of output 27 [2025-03-08 00:43:28,642 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 54 treesize of output 27 [2025-03-08 00:43:28,685 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-03-08 00:43:28,685 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 1 case distinctions, treesize of input 54 treesize of output 31 [2025-03-08 00:43:28,721 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 57 treesize of output 30 [2025-03-08 00:43:28,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:43:28,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 23 [2025-03-08 00:43:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:29,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:30,093 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-08 00:43:30,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 119 treesize of output 108 [2025-03-08 00:43:30,156 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 0 proven. 250 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:43:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886702966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:30,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:30,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 65 [2025-03-08 00:43:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029310730] [2025-03-08 00:43:30,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-08 00:43:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:30,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-08 00:43:30,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=3888, Unknown=0, NotChecked=0, Total=4160 [2025-03-08 00:43:30,158 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 65 states, 65 states have (on average 2.2) internal successors, (143), 65 states have internal predecessors, (143), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)