./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.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 8262fd4bdb4bed8fef0fbefd142e15775d81a64587fab0af0aa2004f91ae895c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:32:26,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:32:26,544 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:32:26,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:32:26,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:32:26,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:32:26,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:32:26,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:32:26,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:32:26,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:32:26,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:32:26,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:32:26,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:32:26,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:32:26,578 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:32:26,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:32:26,578 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:32:26,578 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:32:26,578 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:32:26,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:32:26,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:32:26,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:32:26,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:32:26,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:32:26,580 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:32:26,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:32:26,580 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 -> 8262fd4bdb4bed8fef0fbefd142e15775d81a64587fab0af0aa2004f91ae895c [2025-03-03 09:32:26,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:32:26,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:32:26,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:32:26,816 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:32:26,816 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:32:26,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2025-03-03 09:32:27,961 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae47143e4/6f03137a9941471fa96b5200c7e404d9/FLAG69ad7ddb4 [2025-03-03 09:32:28,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:32:28,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-cav19/array_min_and_copy_shift_sum_add.c [2025-03-03 09:32:28,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae47143e4/6f03137a9941471fa96b5200c7e404d9/FLAG69ad7ddb4 [2025-03-03 09:32:28,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae47143e4/6f03137a9941471fa96b5200c7e404d9 [2025-03-03 09:32:28,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:32:28,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:32:28,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:32:28,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:32:28,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:32:28,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a19926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28, skipping insertion in model container [2025-03-03 09:32:28,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,527 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:32:28,614 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_min_and_copy_shift_sum_add.c[423,436] [2025-03-03 09:32:28,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:32:28,637 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:32:28,644 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_min_and_copy_shift_sum_add.c[423,436] [2025-03-03 09:32:28,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:32:28,665 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:32:28,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28 WrapperNode [2025-03-03 09:32:28,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:32:28,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:32:28,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:32:28,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:32:28,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,695 INFO L138 Inliner]: procedures = 15, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 75 [2025-03-03 09:32:28,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:32:28,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:32:28,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:32:28,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:32:28,702 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,704 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,713 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 5, 2]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 1 writes are split as follows [0, 0, 1]. [2025-03-03 09:32:28,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,722 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,727 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,728 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,729 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:32:28,729 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:32:28,729 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:32:28,729 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:32:28,730 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (1/1) ... [2025-03-03 09:32:28,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:32:28,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:28,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:32:28,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:32:28,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:32:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 09:32:28,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 09:32:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:32:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:32:28,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:32:28,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:32:28,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:32:28,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:32:28,825 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:32:28,826 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:32:28,938 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L18: 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_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset; [2025-03-03 09:32:28,945 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 09:32:28,946 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:32:28,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:32:28,951 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:32:28,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:32:28 BoogieIcfgContainer [2025-03-03 09:32:28,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:32:28,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:32:28,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:32:28,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:32:28,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:32:28" (1/3) ... [2025-03-03 09:32:28,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57339fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:32:28, skipping insertion in model container [2025-03-03 09:32:28,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:32:28" (2/3) ... [2025-03-03 09:32:28,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57339fd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:32:28, skipping insertion in model container [2025-03-03 09:32:28,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:32:28" (3/3) ... [2025-03-03 09:32:28,957 INFO L128 eAbstractionObserver]: Analyzing ICFG array_min_and_copy_shift_sum_add.c [2025-03-03 09:32:28,966 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:32:28,968 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array_min_and_copy_shift_sum_add.c that has 2 procedures, 25 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:32:29,005 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:32:29,013 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;@385fb747, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:32:29,014 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:32:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:32:29,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:32:29,021 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:29,021 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:29,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:29,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:29,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1660025251, now seen corresponding path program 1 times [2025-03-03 09:32:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752841233] [2025-03-03 09:32:29,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:29,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:29,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:32:29,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:32:29,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:29,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:29,128 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-03 09:32:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752841233] [2025-03-03 09:32:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752841233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293141591] [2025-03-03 09:32:29,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:29,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:29,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:29,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:29,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:32:29,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:32:29,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:32:29,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:29,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:29,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 09:32:29,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:29,191 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-03 09:32:29,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:32:29,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293141591] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:32:29,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:32:29,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 09:32:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37050209] [2025-03-03 09:32:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:32:29,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:32:29,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:29,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:32:29,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:32:29,210 INFO L87 Difference]: Start difference. First operand has 25 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-03 09:32:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:29,220 INFO L93 Difference]: Finished difference Result 47 states and 65 transitions. [2025-03-03 09:32:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:32:29,221 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 19 [2025-03-03 09:32:29,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:29,225 INFO L225 Difference]: With dead ends: 47 [2025-03-03 09:32:29,225 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 09:32:29,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:32:29,230 INFO L435 NwaCegarLoop]: 31 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, 31 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:29,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:32:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 09:32:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 09:32:29,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:32:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2025-03-03 09:32:29,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 19 [2025-03-03 09:32:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:29,252 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2025-03-03 09:32:29,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-03 09:32:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2025-03-03 09:32:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 09:32:29,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:29,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:29,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:32:29,453 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-03 09:32:29,454 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:29,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1959927905, now seen corresponding path program 1 times [2025-03-03 09:32:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:29,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199542721] [2025-03-03 09:32:29,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:29,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:29,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 09:32:29,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 09:32:29,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:29,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:29,646 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-03 09:32:29,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:29,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199542721] [2025-03-03 09:32:29,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199542721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:32:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:32:29,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:32:29,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898718667] [2025-03-03 09:32:29,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:32:29,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:32:29,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:29,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:32:29,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:32:29,648 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03 09:32:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:29,660 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2025-03-03 09:32:29,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:32:29,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) Word has length 19 [2025-03-03 09:32:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:29,661 INFO L225 Difference]: With dead ends: 25 [2025-03-03 09:32:29,661 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 09:32:29,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:32:29,662 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:29,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 59 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:32:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 09:32:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 09:32:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:32:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2025-03-03 09:32:29,666 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 19 [2025-03-03 09:32:29,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:29,666 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2025-03-03 09:32:29,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-03 09:32:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2025-03-03 09:32:29,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:32:29,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:29,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:29,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:32:29,667 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:29,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -628191158, now seen corresponding path program 1 times [2025-03-03 09:32:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:29,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005366112] [2025-03-03 09:32:29,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:29,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:29,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 09:32:29,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:32:29,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:29,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:32:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:29,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005366112] [2025-03-03 09:32:29,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005366112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:32:29,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:32:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:32:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171846848] [2025-03-03 09:32:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:32:29,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:32:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:29,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:32:29,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:32:29,776 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-03 09:32:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:29,825 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2025-03-03 09:32:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:32:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 20 [2025-03-03 09:32:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:29,827 INFO L225 Difference]: With dead ends: 37 [2025-03-03 09:32:29,827 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 09:32:29,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:32:29,827 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:29,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:32:29,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 09:32:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2025-03-03 09:32:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:32:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2025-03-03 09:32:29,832 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 20 [2025-03-03 09:32:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:29,832 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2025-03-03 09:32:29,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-03 09:32:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2025-03-03 09:32:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:32:29,833 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:29,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:29,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:32:29,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:29,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:29,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1551076341, now seen corresponding path program 1 times [2025-03-03 09:32:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995410872] [2025-03-03 09:32:29,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:29,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:29,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:32:29,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:32:29,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:29,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:30,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:32:30,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995410872] [2025-03-03 09:32:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995410872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000836299] [2025-03-03 09:32:30,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:30,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:30,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:30,382 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:30,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:32:30,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:32:30,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:32:30,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:30,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:30,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:32:30,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:30,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:32:30,642 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 15 treesize of output 7 [2025-03-03 09:32:30,654 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:32:30,655 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:30,705 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 29 treesize of output 27 [2025-03-03 09:32:30,707 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 32 treesize of output 30 [2025-03-03 09:32:30,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:30,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 18 treesize of output 15 [2025-03-03 09:32:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:32:30,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000836299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:30,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:30,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2025-03-03 09:32:30,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241844485] [2025-03-03 09:32:30,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:30,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:32:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:30,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:32:30,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:32:30,805 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:32:30,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:30,947 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2025-03-03 09:32:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:32:30,947 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2025-03-03 09:32:30,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:30,948 INFO L225 Difference]: With dead ends: 43 [2025-03-03 09:32:30,948 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 09:32:30,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:32:30,949 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 42 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:30,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 132 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:32:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 09:32:30,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-03-03 09:32:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:32:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-03-03 09:32:30,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 31 [2025-03-03 09:32:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:30,960 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-03 09:32:30,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:32:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-03-03 09:32:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:32:30,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:30,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:30,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:32:31,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:32:31,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:31,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 936436492, now seen corresponding path program 1 times [2025-03-03 09:32:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:31,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157805764] [2025-03-03 09:32:31,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:31,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:32:31,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:32:31,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:31,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:32:31,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157805764] [2025-03-03 09:32:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157805764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824888795] [2025-03-03 09:32:31,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:31,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:31,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:31,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:31,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:32:31,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-03 09:32:31,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:32:31,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:31,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:31,605 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:32:31,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:31,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:32:31,788 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 15 treesize of output 7 [2025-03-03 09:32:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:32:31,803 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:31,846 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 29 treesize of output 27 [2025-03-03 09:32:31,849 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 32 treesize of output 30 [2025-03-03 09:32:31,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:31,901 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 18 treesize of output 15 [2025-03-03 09:32:31,942 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:32:31,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824888795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:31,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:31,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2025-03-03 09:32:31,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96983512] [2025-03-03 09:32:31,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:31,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:32:31,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:31,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:32:31,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:32:31,948 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:32:32,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:32,150 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2025-03-03 09:32:32,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:32:32,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2025-03-03 09:32:32,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:32,152 INFO L225 Difference]: With dead ends: 53 [2025-03-03 09:32:32,152 INFO L226 Difference]: Without dead ends: 50 [2025-03-03 09:32:32,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:32:32,153 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:32,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:32:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-03 09:32:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2025-03-03 09:32:32,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:32:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2025-03-03 09:32:32,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 31 [2025-03-03 09:32:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:32,163 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2025-03-03 09:32:32,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:32:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2025-03-03 09:32:32,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:32:32,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:32,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:32,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:32:32,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:32,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:32,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:32,366 INFO L85 PathProgramCache]: Analyzing trace with hash -838694562, now seen corresponding path program 2 times [2025-03-03 09:32:32,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441326074] [2025-03-03 09:32:32,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:32:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:32,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 09:32:32,382 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:32:32,382 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:32:32,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:32:32,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441326074] [2025-03-03 09:32:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441326074] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:32,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246609609] [2025-03-03 09:32:32,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:32:32,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:32,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:32,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:32,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:32:32,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 09:32:32,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:32:32,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:32:32,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:32,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:32:32,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:32,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:32:32,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:32:32,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246609609] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:32,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:32,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-03 09:32:32,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131638078] [2025-03-03 09:32:32,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:32,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:32:32,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:32,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:32:32,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:32:32,565 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:32:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:32,624 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2025-03-03 09:32:32,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:32:32,624 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-03 09:32:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:32,625 INFO L225 Difference]: With dead ends: 62 [2025-03-03 09:32:32,625 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 09:32:32,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:32:32,627 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:32,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 73 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:32:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 09:32:32,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2025-03-03 09:32:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:32:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2025-03-03 09:32:32,635 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 32 [2025-03-03 09:32:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:32,636 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2025-03-03 09:32:32,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:32:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2025-03-03 09:32:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:32:32,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:32,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:32,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:32:32,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:32,838 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:32,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1238191095, now seen corresponding path program 3 times [2025-03-03 09:32:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360071491] [2025-03-03 09:32:32,839 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:32:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:32,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-03 09:32:32,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 41 statements. [2025-03-03 09:32:32,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:32:32,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:32,917 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:32:32,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:32,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360071491] [2025-03-03 09:32:32,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360071491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:32,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115263026] [2025-03-03 09:32:32,917 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:32:32,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:32,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:32,919 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:32,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:32:32,953 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 4 equivalence classes. [2025-03-03 09:32:32,967 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 35 of 41 statements. [2025-03-03 09:32:32,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:32:32,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:32,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:32:32,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:32:33,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:33,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:32:33,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115263026] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:33,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:33,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-03-03 09:32:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553888574] [2025-03-03 09:32:33,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:33,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:32:33,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:33,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:32:33,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:32:33,063 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:32:33,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:33,147 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2025-03-03 09:32:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:32:33,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2025-03-03 09:32:33,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:33,148 INFO L225 Difference]: With dead ends: 48 [2025-03-03 09:32:33,148 INFO L226 Difference]: Without dead ends: 43 [2025-03-03 09:32:33,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:32:33,149 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:33,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:32:33,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-03 09:32:33,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2025-03-03 09:32:33,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 09:32:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2025-03-03 09:32:33,154 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 41 [2025-03-03 09:32:33,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:33,154 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2025-03-03 09:32:33,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 09:32:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2025-03-03 09:32:33,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:32:33,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:33,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:33,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:32:33,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:33,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1112850231, now seen corresponding path program 4 times [2025-03-03 09:32:33,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:33,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964543311] [2025-03-03 09:32:33,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:32:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:33,366 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:32:33,398 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:32:33,398 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:32:33,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:34,073 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:32:34,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964543311] [2025-03-03 09:32:34,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964543311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:34,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917973385] [2025-03-03 09:32:34,074 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:32:34,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:34,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:34,076 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:34,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:32:34,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:32:34,125 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:32:34,125 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:32:34,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:34,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 09:32:34,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:34,415 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 19 treesize of output 13 [2025-03-03 09:32:34,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2025-03-03 09:32:34,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:34,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2025-03-03 09:32:34,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:34,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 15 [2025-03-03 09:32:34,604 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:32:34,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:34,723 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 97 treesize of output 93 [2025-03-03 09:32:34,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:34,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 964 treesize of output 916 [2025-03-03 09:32:34,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:34,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 49 [2025-03-03 09:32:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:32:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917973385] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:35,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:35,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 41 [2025-03-03 09:32:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943193209] [2025-03-03 09:32:35,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:35,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-03 09:32:35,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:35,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-03 09:32:35,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1418, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:32:35,047 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 41 states have internal predecessors, (67), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:32:36,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:36,160 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2025-03-03 09:32:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 09:32:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 41 states have internal predecessors, (67), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 43 [2025-03-03 09:32:36,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:36,161 INFO L225 Difference]: With dead ends: 72 [2025-03-03 09:32:36,161 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 09:32:36,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=662, Invalid=3628, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 09:32:36,163 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 99 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:36,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 215 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:32:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 09:32:36,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 48. [2025-03-03 09:32:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:32:36,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2025-03-03 09:32:36,170 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 67 transitions. Word has length 43 [2025-03-03 09:32:36,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:36,170 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 67 transitions. [2025-03-03 09:32:36,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 41 states have internal predecessors, (67), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:32:36,171 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 67 transitions. [2025-03-03 09:32:36,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:32:36,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:36,171 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:36,177 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-03 09:32:36,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:36,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:36,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:36,376 INFO L85 PathProgramCache]: Analyzing trace with hash 138650546, now seen corresponding path program 5 times [2025-03-03 09:32:36,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:36,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738503859] [2025-03-03 09:32:36,377 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:32:36,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:36,387 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 4 equivalence classes. [2025-03-03 09:32:36,397 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:32:36,397 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:32:36,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:32:36,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:36,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738503859] [2025-03-03 09:32:36,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738503859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:36,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302557002] [2025-03-03 09:32:36,462 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:32:36,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:36,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:36,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:36,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:32:36,496 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 4 equivalence classes. [2025-03-03 09:32:36,517 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:32:36,517 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-03 09:32:36,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:36,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:32:36,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:32:36,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 09:32:36,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302557002] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:36,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:36,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-03 09:32:36,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63898131] [2025-03-03 09:32:36,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:36,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:32:36,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:36,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:32:36,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:32:36,629 INFO L87 Difference]: Start difference. First operand 48 states and 67 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:32:36,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:36,718 INFO L93 Difference]: Finished difference Result 85 states and 119 transitions. [2025-03-03 09:32:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:32:36,719 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2025-03-03 09:32:36,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:36,719 INFO L225 Difference]: With dead ends: 85 [2025-03-03 09:32:36,720 INFO L226 Difference]: Without dead ends: 66 [2025-03-03 09:32:36,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:32:36,721 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:36,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 88 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:32:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-03 09:32:36,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2025-03-03 09:32:36,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 45 states have internal predecessors, (59), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:32:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2025-03-03 09:32:36,733 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 44 [2025-03-03 09:32:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:36,734 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2025-03-03 09:32:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 4 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:32:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2025-03-03 09:32:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:32:36,734 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:36,735 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:36,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:32:36,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:36,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:36,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1030299430, now seen corresponding path program 6 times [2025-03-03 09:32:36,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:36,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614346068] [2025-03-03 09:32:36,937 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:32:36,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:36,944 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 5 equivalence classes. [2025-03-03 09:32:36,968 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:32:36,969 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:32:36,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:37,070 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 09:32:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614346068] [2025-03-03 09:32:37,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614346068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819369308] [2025-03-03 09:32:37,070 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:32:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:37,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:37,072 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:37,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:32:37,112 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 5 equivalence classes. [2025-03-03 09:32:37,133 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 54 of 54 statements. [2025-03-03 09:32:37,133 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:32:37,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:37,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:32:37,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 09:32:37,197 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-03 09:32:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819369308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:37,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:32:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29852772] [2025-03-03 09:32:37,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:37,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:32:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:37,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:32:37,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:32:37,269 INFO L87 Difference]: Start difference. First operand 53 states and 71 transitions. Second operand has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 09:32:37,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:37,389 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2025-03-03 09:32:37,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:32:37,391 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2025-03-03 09:32:37,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:37,391 INFO L225 Difference]: With dead ends: 59 [2025-03-03 09:32:37,391 INFO L226 Difference]: Without dead ends: 56 [2025-03-03 09:32:37,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:32:37,392 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:37,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 162 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:32:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-03 09:32:37,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2025-03-03 09:32:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:32:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2025-03-03 09:32:37,402 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 54 [2025-03-03 09:32:37,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:37,403 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2025-03-03 09:32:37,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0) internal successors, (42), 14 states have internal predecessors, (42), 5 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-03 09:32:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2025-03-03 09:32:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:32:37,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:37,404 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:37,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:32:37,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:32:37,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:37,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:37,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1874543011, now seen corresponding path program 7 times [2025-03-03 09:32:37,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:37,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570368360] [2025-03-03 09:32:37,605 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:32:37,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:37,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:32:37,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:37,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:37,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:38,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:38,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570368360] [2025-03-03 09:32:38,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570368360] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:38,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180085971] [2025-03-03 09:32:38,732 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:32:38,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:38,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:38,734 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:38,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:32:38,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:32:38,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:38,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:38,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:38,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-03 09:32:38,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:39,261 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 19 treesize of output 13 [2025-03-03 09:32:39,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2025-03-03 09:32:39,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:39,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 55 [2025-03-03 09:32:39,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2025-03-03 09:32:39,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:39,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 21 [2025-03-03 09:32:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:32:39,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:39,802 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 207 treesize of output 201 [2025-03-03 09:32:39,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:39,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 320518 treesize of output 310278 [2025-03-03 09:32:40,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:40,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 99 [2025-03-03 09:32:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 10 proven. 23 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:40,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180085971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:40,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:40,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 20] total 57 [2025-03-03 09:32:40,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031186544] [2025-03-03 09:32:40,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:40,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-03 09:32:40,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:40,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-03 09:32:40,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2877, Unknown=0, NotChecked=0, Total=3192 [2025-03-03 09:32:40,581 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 57 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 57 states have internal predecessors, (89), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:32:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:42,920 INFO L93 Difference]: Finished difference Result 126 states and 165 transitions. [2025-03-03 09:32:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-03 09:32:42,921 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 57 states have internal predecessors, (89), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 55 [2025-03-03 09:32:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:42,922 INFO L225 Difference]: With dead ends: 126 [2025-03-03 09:32:42,922 INFO L226 Difference]: Without dead ends: 123 [2025-03-03 09:32:42,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3183 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1228, Invalid=9278, Unknown=0, NotChecked=0, Total=10506 [2025-03-03 09:32:42,925 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 159 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:42,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 439 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:32:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-03 09:32:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 85. [2025-03-03 09:32:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-03 09:32:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2025-03-03 09:32:42,948 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 55 [2025-03-03 09:32:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:42,948 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2025-03-03 09:32:42,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 57 states have internal predecessors, (89), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:32:42,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2025-03-03 09:32:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:32:42,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:42,949 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:42,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:32:43,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:43,150 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:43,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1581140004, now seen corresponding path program 1 times [2025-03-03 09:32:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:43,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508751764] [2025-03-03 09:32:43,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:43,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:32:43,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:43,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:43,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:44,134 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:44,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:44,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508751764] [2025-03-03 09:32:44,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508751764] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:44,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867089050] [2025-03-03 09:32:44,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:32:44,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:44,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:44,136 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:32:44,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:32:44,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 09:32:44,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:44,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:32:44,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:44,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-03 09:32:44,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:44,577 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 19 treesize of output 13 [2025-03-03 09:32:44,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2025-03-03 09:32:44,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:44,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 50 [2025-03-03 09:32:44,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-03-03 09:32:44,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:44,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 19 [2025-03-03 09:32:44,874 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:32:44,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:45,050 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 207 treesize of output 201 [2025-03-03 09:32:45,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:45,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77034 treesize of output 74474 [2025-03-03 09:32:45,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:45,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 104 [2025-03-03 09:32:45,769 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867089050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:45,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:45,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 56 [2025-03-03 09:32:45,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304026913] [2025-03-03 09:32:45,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:45,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-03 09:32:45,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:45,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-03 09:32:45,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2797, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 09:32:45,771 INFO L87 Difference]: Start difference. First operand 85 states and 118 transitions. Second operand has 56 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 56 states have internal predecessors, (88), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:32:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:47,975 INFO L93 Difference]: Finished difference Result 165 states and 226 transitions. [2025-03-03 09:32:47,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 09:32:47,976 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 56 states have internal predecessors, (88), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 55 [2025-03-03 09:32:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:47,977 INFO L225 Difference]: With dead ends: 165 [2025-03-03 09:32:47,977 INFO L226 Difference]: Without dead ends: 162 [2025-03-03 09:32:47,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2544 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1043, Invalid=8269, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 09:32:47,979 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 181 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:47,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 536 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:32:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-03-03 09:32:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 97. [2025-03-03 09:32:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 09:32:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2025-03-03 09:32:48,001 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 55 [2025-03-03 09:32:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:48,001 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2025-03-03 09:32:48,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.5714285714285714) internal successors, (88), 56 states have internal predecessors, (88), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:32:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2025-03-03 09:32:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:32:48,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:48,002 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:48,008 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-03 09:32:48,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:32:48,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1175659804, now seen corresponding path program 2 times [2025-03-03 09:32:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:48,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104664600] [2025-03-03 09:32:48,203 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:32:48,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:48,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:32:48,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:48,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:32:48,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:49,163 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:49,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104664600] [2025-03-03 09:32:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104664600] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:49,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210001523] [2025-03-03 09:32:49,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:32:49,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:49,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:49,166 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-03 09:32:49,167 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-03 09:32:49,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:32:49,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:49,222 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:32:49,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:49,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 09:32:49,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:49,537 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 19 treesize of output 13 [2025-03-03 09:32:49,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2025-03-03 09:32:49,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:49,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 95 treesize of output 55 [2025-03-03 09:32:49,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2025-03-03 09:32:49,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:49,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 21 [2025-03-03 09:32:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:49,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:49,962 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 207 treesize of output 201 [2025-03-03 09:32:49,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:49,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 322822 treesize of output 312582 [2025-03-03 09:32:50,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:50,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 99 [2025-03-03 09:32:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:50,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210001523] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:32:50,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:32:50,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 20] total 55 [2025-03-03 09:32:50,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70259811] [2025-03-03 09:32:50,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:50,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 09:32:50,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:50,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 09:32:50,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2663, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 09:32:50,577 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 55 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 states have internal predecessors, (86), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:32:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:52,930 INFO L93 Difference]: Finished difference Result 162 states and 224 transitions. [2025-03-03 09:32:52,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-03 09:32:52,930 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 states have internal predecessors, (86), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Word has length 55 [2025-03-03 09:32:52,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:52,931 INFO L225 Difference]: With dead ends: 162 [2025-03-03 09:32:52,931 INFO L226 Difference]: Without dead ends: 155 [2025-03-03 09:32:52,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2654 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1209, Invalid=8103, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 09:32:52,933 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 144 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 1417 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 1572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:52,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 490 Invalid, 1572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:32:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-03-03 09:32:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 119. [2025-03-03 09:32:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 102 states have (on average 1.3823529411764706) internal successors, (141), 102 states have internal predecessors, (141), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:32:52,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2025-03-03 09:32:52,962 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 169 transitions. Word has length 55 [2025-03-03 09:32:52,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:52,962 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 169 transitions. [2025-03-03 09:32:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 states have internal predecessors, (86), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:32:52,962 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 169 transitions. [2025-03-03 09:32:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:32:52,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:52,963 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:52,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:32:53,164 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,SelfDestructingSolverStorable12 [2025-03-03 09:32:53,164 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:53,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash -309133916, now seen corresponding path program 3 times [2025-03-03 09:32:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937213505] [2025-03-03 09:32:53,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:32:53,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:53,171 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 5 equivalence classes. [2025-03-03 09:32:53,185 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:53,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:32:53,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:53,831 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:53,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937213505] [2025-03-03 09:32:53,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937213505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:53,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969424673] [2025-03-03 09:32:53,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:32:53,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:53,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:53,834 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-03 09:32:53,835 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-03 09:32:53,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 55 statements into 5 equivalence classes. [2025-03-03 09:32:53,899 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:53,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:32:53,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:53,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 09:32:53,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:54,414 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 19 treesize of output 13 [2025-03-03 09:32:54,471 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 35 treesize of output 32 [2025-03-03 09:32:54,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:54,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 79 treesize of output 68 [2025-03-03 09:32:54,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:32:54,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:32:54,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:54,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 66 [2025-03-03 09:32:54,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:54,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 21 [2025-03-03 09:32:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:32:54,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:32:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969424673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:55,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:32:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 43 [2025-03-03 09:32:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618329159] [2025-03-03 09:32:55,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:32:55,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 09:32:55,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:32:55,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 09:32:55,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2875, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 09:32:55,477 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 09:32:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:32:58,158 INFO L93 Difference]: Finished difference Result 242 states and 330 transitions. [2025-03-03 09:32:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-03 09:32:58,158 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 55 [2025-03-03 09:32:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:32:58,159 INFO L225 Difference]: With dead ends: 242 [2025-03-03 09:32:58,159 INFO L226 Difference]: Without dead ends: 230 [2025-03-03 09:32:58,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3592 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1939, Invalid=10943, Unknown=0, NotChecked=0, Total=12882 [2025-03-03 09:32:58,162 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 135 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:32:58,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 425 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:32:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-03 09:32:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 124. [2025-03-03 09:32:58,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 106 states have internal predecessors, (145), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 09:32:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2025-03-03 09:32:58,191 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 55 [2025-03-03 09:32:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:32:58,191 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2025-03-03 09:32:58,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.441860465116279) internal successors, (62), 43 states have internal predecessors, (62), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 09:32:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2025-03-03 09:32:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:32:58,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:32:58,192 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:32:58,198 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-03 09:32:58,397 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,SelfDestructingSolverStorable13 [2025-03-03 09:32:58,397 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:32:58,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:32:58,397 INFO L85 PathProgramCache]: Analyzing trace with hash -602536923, now seen corresponding path program 4 times [2025-03-03 09:32:58,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:32:58,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590148538] [2025-03-03 09:32:58,397 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:32:58,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:32:58,402 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:32:58,412 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:58,412 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:32:58,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:32:59,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:32:59,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590148538] [2025-03-03 09:32:59,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590148538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:32:59,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672064164] [2025-03-03 09:32:59,096 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:32:59,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:32:59,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:32:59,099 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-03 09:32:59,101 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-03 09:32:59,142 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-03 09:32:59,162 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:32:59,162 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:32:59,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:32:59,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-03 09:32:59,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:32:59,785 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 19 treesize of output 13 [2025-03-03 09:32:59,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2025-03-03 09:32:59,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:32:59,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 50 [2025-03-03 09:32:59,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2025-03-03 09:33:00,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:00,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 19 [2025-03-03 09:33:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:33:00,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:00,285 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 207 treesize of output 201 [2025-03-03 09:33:00,302 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:00,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76818 treesize of output 74258 [2025-03-03 09:33:00,899 INFO L349 Elim1Store]: treesize reduction 30, result has 62.0 percent of original size [2025-03-03 09:33:00,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 93 treesize of output 74 [2025-03-03 09:33:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:33:01,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672064164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:01,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:01,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 26, 23] total 64 [2025-03-03 09:33:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048537247] [2025-03-03 09:33:01,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:01,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-03 09:33:01,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:01,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-03 09:33:01,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=544, Invalid=3488, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 09:33:01,088 INFO L87 Difference]: Start difference. First operand 124 states and 173 transitions. Second operand has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 62 states have internal predecessors, (91), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-03 09:33:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:06,874 INFO L93 Difference]: Finished difference Result 377 states and 537 transitions. [2025-03-03 09:33:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2025-03-03 09:33:06,875 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 62 states have internal predecessors, (91), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) Word has length 55 [2025-03-03 09:33:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:06,876 INFO L225 Difference]: With dead ends: 377 [2025-03-03 09:33:06,876 INFO L226 Difference]: Without dead ends: 373 [2025-03-03 09:33:06,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8459 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3187, Invalid=21619, Unknown=0, NotChecked=0, Total=24806 [2025-03-03 09:33:06,878 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 247 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 1950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:06,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 502 Invalid, 1950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:33:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2025-03-03 09:33:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 160. [2025-03-03 09:33:06,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 136 states have internal predecessors, (193), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 09:33:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 233 transitions. [2025-03-03 09:33:06,923 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 233 transitions. Word has length 55 [2025-03-03 09:33:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:06,923 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 233 transitions. [2025-03-03 09:33:06,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 62 states have internal predecessors, (91), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (13), 13 states have call predecessors, (13), 12 states have call successors, (13) [2025-03-03 09:33:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 233 transitions. [2025-03-03 09:33:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 09:33:06,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:06,925 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:06,931 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-03 09:33:07,125 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,SelfDestructingSolverStorable14 [2025-03-03 09:33:07,125 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:07,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:07,126 INFO L85 PathProgramCache]: Analyzing trace with hash 935630565, now seen corresponding path program 5 times [2025-03-03 09:33:07,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:07,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329542937] [2025-03-03 09:33:07,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:33:07,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:07,131 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 5 equivalence classes. [2025-03-03 09:33:07,142 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:33:07,142 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:33:07,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:33:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329542937] [2025-03-03 09:33:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329542937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:07,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968375565] [2025-03-03 09:33:07,805 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:33:07,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:07,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:07,807 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-03 09:33:07,808 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-03 09:33:07,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 55 statements into 5 equivalence classes. [2025-03-03 09:33:07,884 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 09:33:07,884 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:33:07,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:07,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 09:33:07,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:08,212 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 19 treesize of output 13 [2025-03-03 09:33:08,256 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 35 treesize of output 32 [2025-03-03 09:33:08,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:08,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 77 treesize of output 66 [2025-03-03 09:33:08,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:08,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 58 [2025-03-03 09:33:08,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:08,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 21 [2025-03-03 09:33:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:33:08,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:08,707 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 207 treesize of output 201 [2025-03-03 09:33:08,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:08,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1229746 treesize of output 1188786 [2025-03-03 09:33:09,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:09,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 81 treesize of output 99 [2025-03-03 09:33:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:33:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968375565] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:09,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2025-03-03 09:33:09,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480024750] [2025-03-03 09:33:09,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:09,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-03 09:33:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:09,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-03 09:33:09,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2800, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 09:33:09,434 INFO L87 Difference]: Start difference. First operand 160 states and 233 transitions. Second operand has 56 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 56 states have internal predecessors, (85), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 09:33:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:11,403 INFO L93 Difference]: Finished difference Result 262 states and 372 transitions. [2025-03-03 09:33:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-03 09:33:11,403 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 56 states have internal predecessors, (85), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 55 [2025-03-03 09:33:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:11,405 INFO L225 Difference]: With dead ends: 262 [2025-03-03 09:33:11,405 INFO L226 Difference]: Without dead ends: 259 [2025-03-03 09:33:11,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1839 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1027, Invalid=7529, Unknown=0, NotChecked=0, Total=8556 [2025-03-03 09:33:11,406 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 112 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:11,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 453 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:33:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-03 09:33:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2025-03-03 09:33:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 143 states have internal predecessors, (203), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-03 09:33:11,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 245 transitions. [2025-03-03 09:33:11,458 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 245 transitions. Word has length 55 [2025-03-03 09:33:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:11,458 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 245 transitions. [2025-03-03 09:33:11,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 56 states have internal predecessors, (85), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-03 09:33:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 245 transitions. [2025-03-03 09:33:11,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 09:33:11,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:11,459 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:11,465 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-03 09:33:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:11,660 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1770731621, now seen corresponding path program 6 times [2025-03-03 09:33:11,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:11,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158357708] [2025-03-03 09:33:11,660 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:33:11,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:11,668 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-03-03 09:33:11,678 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:33:11,679 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:33:11,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:33:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158357708] [2025-03-03 09:33:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158357708] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151289157] [2025-03-03 09:33:11,744 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:33:11,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:11,746 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-03 09:33:11,747 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-03 09:33:11,793 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 56 statements into 5 equivalence classes. [2025-03-03 09:33:11,814 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 09:33:11,814 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-03-03 09:33:11,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:11,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:33:11,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:33:11,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 09:33:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151289157] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:11,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:11,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-03 09:33:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373724818] [2025-03-03 09:33:11,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:11,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:33:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:11,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:33:11,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:33:11,915 INFO L87 Difference]: Start difference. First operand 168 states and 245 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:33:12,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:12,086 INFO L93 Difference]: Finished difference Result 266 states and 383 transitions. [2025-03-03 09:33:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:33:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 56 [2025-03-03 09:33:12,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:12,088 INFO L225 Difference]: With dead ends: 266 [2025-03-03 09:33:12,088 INFO L226 Difference]: Without dead ends: 229 [2025-03-03 09:33:12,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:33:12,088 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:12,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 76 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:33:12,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-03 09:33:12,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 170. [2025-03-03 09:33:12,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 146 states have (on average 1.36986301369863) internal successors, (200), 146 states have internal predecessors, (200), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 09:33:12,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2025-03-03 09:33:12,150 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 56 [2025-03-03 09:33:12,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:12,150 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2025-03-03 09:33:12,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:33:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2025-03-03 09:33:12,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 09:33:12,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:12,151 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:12,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:12,351 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,SelfDestructingSolverStorable16 [2025-03-03 09:33:12,351 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:12,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:12,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1593565203, now seen corresponding path program 2 times [2025-03-03 09:33:12,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:12,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570071050] [2025-03-03 09:33:12,352 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:12,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:12,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-03 09:33:12,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 09:33:12,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:12,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 09:33:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570071050] [2025-03-03 09:33:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570071050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840042858] [2025-03-03 09:33:12,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:12,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:12,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:12,434 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-03 09:33:12,436 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-03 09:33:12,487 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 2 equivalence classes. [2025-03-03 09:33:12,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 65 of 65 statements. [2025-03-03 09:33:12,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:12,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:12,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:33:12,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 09:33:12,575 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:12,653 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 21 proven. 25 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 09:33:12,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840042858] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:12,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:12,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:33:12,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2336209] [2025-03-03 09:33:12,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:12,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:33:12,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:12,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:33:12,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:33:12,654 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-03 09:33:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:12,840 INFO L93 Difference]: Finished difference Result 177 states and 247 transitions. [2025-03-03 09:33:12,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 09:33:12,840 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 65 [2025-03-03 09:33:12,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:12,841 INFO L225 Difference]: With dead ends: 177 [2025-03-03 09:33:12,841 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 09:33:12,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 116 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:33:12,842 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:12,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 168 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:33:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 09:33:12,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 66. [2025-03-03 09:33:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 09:33:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2025-03-03 09:33:12,875 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 65 [2025-03-03 09:33:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:12,875 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2025-03-03 09:33:12,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 6 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-03 09:33:12,875 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2025-03-03 09:33:12,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:33:12,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:12,876 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:12,882 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-03 09:33:13,076 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,SelfDestructingSolverStorable17 [2025-03-03 09:33:13,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:13,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:13,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1405875505, now seen corresponding path program 8 times [2025-03-03 09:33:13,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:13,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075420172] [2025-03-03 09:33:13,077 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:13,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-03 09:33:13,099 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:33:13,099 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:13,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:33:14,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075420172] [2025-03-03 09:33:14,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075420172] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:14,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116089902] [2025-03-03 09:33:14,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:14,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:14,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:14,419 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-03 09:33:14,420 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-03 09:33:14,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-03 09:33:14,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:33:14,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:14,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:14,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 09:33:14,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:15,141 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 19 treesize of output 13 [2025-03-03 09:33:15,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2025-03-03 09:33:15,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:15,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2025-03-03 09:33:15,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:15,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 131 treesize of output 75 [2025-03-03 09:33:15,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2025-03-03 09:33:15,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:15,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 27 [2025-03-03 09:33:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:33:15,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:15,955 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 359 treesize of output 351 [2025-03-03 09:33:16,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:16,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46823852058 treesize of output 45884327962 [2025-03-03 09:33:19,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:19,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 167 [2025-03-03 09:33:20,472 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:33:20,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116089902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:20,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:20,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 25] total 73 [2025-03-03 09:33:20,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638189674] [2025-03-03 09:33:20,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:20,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-03 09:33:20,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:20,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-03 09:33:20,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=4820, Unknown=0, NotChecked=0, Total=5256 [2025-03-03 09:33:20,474 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 73 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:33:28,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:28,890 INFO L93 Difference]: Finished difference Result 235 states and 307 transitions. [2025-03-03 09:33:28,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2025-03-03 09:33:28,890 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 67 [2025-03-03 09:33:28,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:28,891 INFO L225 Difference]: With dead ends: 235 [2025-03-03 09:33:28,891 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 09:33:28,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9383 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3068, Invalid=27034, Unknown=0, NotChecked=0, Total=30102 [2025-03-03 09:33:28,894 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 279 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:28,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 732 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 09:33:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 09:33:28,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 139. [2025-03-03 09:33:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 117 states have (on average 1.3504273504273505) internal successors, (158), 117 states have internal predecessors, (158), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 09:33:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 192 transitions. [2025-03-03 09:33:28,983 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 192 transitions. Word has length 67 [2025-03-03 09:33:28,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:28,983 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 192 transitions. [2025-03-03 09:33:28,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.547945205479452) internal successors, (113), 73 states have internal predecessors, (113), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:33:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 192 transitions. [2025-03-03 09:33:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:33:28,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:28,984 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:28,990 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-03 09:33:29,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:29,184 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:29,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:29,185 INFO L85 PathProgramCache]: Analyzing trace with hash 101676304, now seen corresponding path program 7 times [2025-03-03 09:33:29,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:29,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655557099] [2025-03-03 09:33:29,185 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:33:29,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:29,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 09:33:29,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:33:29,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:29,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:33:30,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655557099] [2025-03-03 09:33:30,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655557099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:30,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646644991] [2025-03-03 09:33:30,489 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:33:30,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:30,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:30,491 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-03 09:33:30,491 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-03 09:33:30,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-03 09:33:30,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:33:30,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:33:30,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:30,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-03 09:33:30,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:31,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 19 treesize of output 13 [2025-03-03 09:33:31,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2025-03-03 09:33:31,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:31,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2025-03-03 09:33:31,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:31,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 97 [2025-03-03 09:33:31,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:31,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 65 [2025-03-03 09:33:32,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:32,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 25 [2025-03-03 09:33:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:33:32,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:32,535 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 359 treesize of output 351 [2025-03-03 09:33:32,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:32,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 179270062 treesize of output 175600046 [2025-03-03 09:33:33,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:33,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 130 treesize of output 173 [2025-03-03 09:33:35,165 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:33:35,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646644991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:35,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:35,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 25] total 72 [2025-03-03 09:33:35,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629647741] [2025-03-03 09:33:35,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:35,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-03 09:33:35,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:35,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-03 09:33:35,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=4705, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 09:33:35,167 INFO L87 Difference]: Start difference. First operand 139 states and 192 transitions. Second operand has 72 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 72 states have internal predecessors, (113), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:33:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:42,507 INFO L93 Difference]: Finished difference Result 264 states and 348 transitions. [2025-03-03 09:33:42,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-03 09:33:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 72 states have internal predecessors, (113), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 67 [2025-03-03 09:33:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:42,509 INFO L225 Difference]: With dead ends: 264 [2025-03-03 09:33:42,509 INFO L226 Difference]: Without dead ends: 260 [2025-03-03 09:33:42,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 89 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6956 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2325, Invalid=21545, Unknown=0, NotChecked=0, Total=23870 [2025-03-03 09:33:42,511 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 246 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 2657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:42,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 882 Invalid, 2657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 09:33:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-03-03 09:33:42,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 129. [2025-03-03 09:33:42,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.3302752293577982) internal successors, (145), 109 states have internal predecessors, (145), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-03 09:33:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 175 transitions. [2025-03-03 09:33:42,592 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 175 transitions. Word has length 67 [2025-03-03 09:33:42,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:42,593 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 175 transitions. [2025-03-03 09:33:42,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.5694444444444444) internal successors, (113), 72 states have internal predecessors, (113), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:33:42,593 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 175 transitions. [2025-03-03 09:33:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:33:42,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:42,593 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:42,600 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-03 09:33:42,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:42,798 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:42,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:42,798 INFO L85 PathProgramCache]: Analyzing trace with hash 811882448, now seen corresponding path program 8 times [2025-03-03 09:33:42,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:42,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78880174] [2025-03-03 09:33:42,799 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:42,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-03 09:33:42,825 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:33:42,825 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:42,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:44,216 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 1 proven. 59 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:33:44,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:33:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78880174] [2025-03-03 09:33:44,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78880174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:33:44,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618939818] [2025-03-03 09:33:44,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:33:44,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:44,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:33:44,218 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-03 09:33:44,218 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-03 09:33:44,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-03-03 09:33:44,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-03-03 09:33:44,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:33:44,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:33:44,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 09:33:44,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:33:45,129 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 19 treesize of output 13 [2025-03-03 09:33:45,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2025-03-03 09:33:45,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:45,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2025-03-03 09:33:45,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:45,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 84 [2025-03-03 09:33:45,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:45,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 70 [2025-03-03 09:33:45,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:45,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 27 [2025-03-03 09:33:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 32 proven. 60 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 09:33:45,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:33:46,156 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 359 treesize of output 351 [2025-03-03 09:33:46,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:46,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 10236623419934 treesize of output 10022948796958 [2025-03-03 09:33:50,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:33:50,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 167 [2025-03-03 09:33:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:33:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618939818] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:33:52,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:33:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 25] total 72 [2025-03-03 09:33:52,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039881442] [2025-03-03 09:33:52,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:33:52,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2025-03-03 09:33:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:33:52,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2025-03-03 09:33:52,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=4681, Unknown=0, NotChecked=0, Total=5112 [2025-03-03 09:33:52,089 INFO L87 Difference]: Start difference. First operand 129 states and 175 transitions. Second operand has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:33:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:33:58,833 INFO L93 Difference]: Finished difference Result 240 states and 315 transitions. [2025-03-03 09:33:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-03-03 09:33:58,834 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Word has length 67 [2025-03-03 09:33:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:33:58,835 INFO L225 Difference]: With dead ends: 240 [2025-03-03 09:33:58,835 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 09:33:58,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6524 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2376, Invalid=19676, Unknown=0, NotChecked=0, Total=22052 [2025-03-03 09:33:58,837 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 208 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 2631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:33:58,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 688 Invalid, 2631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 09:33:58,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 09:33:58,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 133. [2025-03-03 09:33:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:33:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 182 transitions. [2025-03-03 09:33:58,924 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 182 transitions. Word has length 67 [2025-03-03 09:33:58,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:33:58,925 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 182 transitions. [2025-03-03 09:33:58,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.5277777777777777) internal successors, (110), 72 states have internal predecessors, (110), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:33:58,925 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 182 transitions. [2025-03-03 09:33:58,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-03 09:33:58,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:33:58,925 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:33:58,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 09:33:59,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:33:59,126 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:33:59,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:33:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 319605392, now seen corresponding path program 9 times [2025-03-03 09:33:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:33:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265722410] [2025-03-03 09:33:59,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:33:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:33:59,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 67 statements into 6 equivalence classes. [2025-03-03 09:33:59,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 59 of 67 statements. [2025-03-03 09:33:59,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:33:59,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat