./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/brs5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/brs5.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 908db381a067cd65920e47aeaa3ff4913a67de2048af6864f01f76e8ca691571 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:43:18,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:43:18,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:43:18,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:43:18,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:43:18,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:43:18,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:43:18,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:43:18,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:43:18,096 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:43:18,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:43:18,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:43:18,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:43:18,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:43:18,098 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:43:18,098 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:43:18,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:43:18,098 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 -> 908db381a067cd65920e47aeaa3ff4913a67de2048af6864f01f76e8ca691571 [2025-03-08 00:43:18,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:43:18,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:43:18,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:43:18,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:43:18,310 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:43:18,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/brs5.c [2025-03-08 00:43:19,435 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe5a88ae/cf877dbbff34494a92d3b4d8a975465d/FLAG51de28b4e [2025-03-08 00:43:19,651 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:43:19,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs5.c [2025-03-08 00:43:19,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe5a88ae/cf877dbbff34494a92d3b4d8a975465d/FLAG51de28b4e [2025-03-08 00:43:19,992 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfe5a88ae/cf877dbbff34494a92d3b4d8a975465d [2025-03-08 00:43:19,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:43:19,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:43:19,995 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:43:19,995 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:43:19,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:43:19,999 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:43:19" (1/1) ... [2025-03-08 00:43:19,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ed06e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:19, skipping insertion in model container [2025-03-08 00:43:19,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:43:19" (1/1) ... [2025-03-08 00:43:20,008 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:43:20,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs5.c[587,600] [2025-03-08 00:43:20,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:43:20,132 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:43:20,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/brs5.c[587,600] [2025-03-08 00:43:20,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:43:20,160 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:43:20,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20 WrapperNode [2025-03-08 00:43:20,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:43:20,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:43:20,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:43:20,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:43:20,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,183 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 67 [2025-03-08 00:43:20,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:43:20,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:43:20,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:43:20,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:43:20,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,192 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,202 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 7, 4, 3]. 44 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 2, 2]. [2025-03-08 00:43:20,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,207 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:43:20,212 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:43:20,212 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:43:20,212 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:43:20,213 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (1/1) ... [2025-03-08 00:43:20,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:43:20,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:20,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:43:20,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:43:20,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:43:20,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:43:20,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:43:20,306 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:43:20,307 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:43:20,407 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-08 00:43:20,410 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 00:43:20,411 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:43:20,419 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:43:20,420 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:43:20,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:43:20 BoogieIcfgContainer [2025-03-08 00:43:20,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:43:20,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:43:20,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:43:20,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:43:20,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:43:19" (1/3) ... [2025-03-08 00:43:20,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db499f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:43:20, skipping insertion in model container [2025-03-08 00:43:20,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:43:20" (2/3) ... [2025-03-08 00:43:20,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db499f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:43:20, skipping insertion in model container [2025-03-08 00:43:20,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:43:20" (3/3) ... [2025-03-08 00:43:20,426 INFO L128 eAbstractionObserver]: Analyzing ICFG brs5.c [2025-03-08 00:43:20,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:43:20,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG brs5.c that has 1 procedures, 18 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-08 00:43:20,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:43:20,475 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;@3092f076, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:43:20,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:43:20,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:43:20,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:20,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:20,482 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:20,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:20,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1883979954, now seen corresponding path program 1 times [2025-03-08 00:43:20,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:20,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187638196] [2025-03-08 00:43:20,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:43:20,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:20,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:43:20,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:43:20,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:20,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187638196] [2025-03-08 00:43:20,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187638196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:43:20,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:43:20,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:43:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028924153] [2025-03-08 00:43:20,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:43:20,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:43:20,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:20,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:43:20,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:43:20,600 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:20,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:20,607 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-08 00:43:20,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:43:20,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:43:20,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:20,611 INFO L225 Difference]: With dead ends: 32 [2025-03-08 00:43:20,611 INFO L226 Difference]: Without dead ends: 14 [2025-03-08 00:43:20,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:43:20,614 INFO L435 NwaCegarLoop]: 22 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, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:20,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:43:20,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-03-08 00:43:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-03-08 00:43:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:20,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2025-03-08 00:43:20,630 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 9 [2025-03-08 00:43:20,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:20,630 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2025-03-08 00:43:20,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:20,630 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2025-03-08 00:43:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 00:43:20,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:20,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:20,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:43:20,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:20,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1912609105, now seen corresponding path program 1 times [2025-03-08 00:43:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205763567] [2025-03-08 00:43:20,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:43:20,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:20,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 00:43:20,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 00:43:20,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:20,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:20,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:20,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205763567] [2025-03-08 00:43:20,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205763567] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:43:20,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:43:20,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:43:20,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542921585] [2025-03-08 00:43:20,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:43:20,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:43:20,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:20,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:43:20,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:43:20,756 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:20,795 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2025-03-08 00:43:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:43:20,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-08 00:43:20,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:20,796 INFO L225 Difference]: With dead ends: 29 [2025-03-08 00:43:20,796 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:43:20,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:43:20,797 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:20,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:43:20,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:43:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-08 00:43:20,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2025-03-08 00:43:20,803 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2025-03-08 00:43:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:20,803 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2025-03-08 00:43:20,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2025-03-08 00:43:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:43:20,803 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:20,803 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:20,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:43:20,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:20,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:20,804 INFO L85 PathProgramCache]: Analyzing trace with hash 82669488, now seen corresponding path program 1 times [2025-03-08 00:43:20,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:20,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324503481] [2025-03-08 00:43:20,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:43:20,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:20,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:43:20,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:43:20,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:20,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:43:20,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:20,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324503481] [2025-03-08 00:43:20,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324503481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:43:20,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:43:20,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:43:20,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332311745] [2025-03-08 00:43:20,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:43:20,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:43:20,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:20,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:43:20,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:43:20,994 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:21,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:21,040 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2025-03-08 00:43:21,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:43:21,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 00:43:21,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:21,041 INFO L225 Difference]: With dead ends: 24 [2025-03-08 00:43:21,041 INFO L226 Difference]: Without dead ends: 21 [2025-03-08 00:43:21,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:43:21,041 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:21,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:43:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-08 00:43:21,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-08 00:43:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:21,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-08 00:43:21,047 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2025-03-08 00:43:21,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:21,047 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-08 00:43:21,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-08 00:43:21,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 00:43:21,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:21,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:21,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:43:21,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:21,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:21,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1909717652, now seen corresponding path program 1 times [2025-03-08 00:43:21,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:21,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405877419] [2025-03-08 00:43:21,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:43:21,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:21,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:43:21,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:43:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:21,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:21,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405877419] [2025-03-08 00:43:21,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405877419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:21,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031611240] [2025-03-08 00:43:21,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:43:21,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:21,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:21,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:21,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:43:21,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 00:43:21,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 00:43:21,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:21,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:21,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:43:21,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:21,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:21,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:21,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031611240] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:21,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:21,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 00:43:21,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389086492] [2025-03-08 00:43:21,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:21,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:43:21,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:21,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:43:21,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:43:21,330 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:21,402 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-03-08 00:43:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:43:21,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 00:43:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:21,403 INFO L225 Difference]: With dead ends: 39 [2025-03-08 00:43:21,403 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:43:21,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:43:21,405 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:21,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:43:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2025-03-08 00:43:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 00:43:21,410 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2025-03-08 00:43:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:21,410 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 00:43:21,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 00:43:21,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:43:21,411 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:21,411 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:21,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:43:21,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:21,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash -402987183, now seen corresponding path program 1 times [2025-03-08 00:43:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:21,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838455244] [2025-03-08 00:43:21,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:43:21,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:21,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:43:21,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:43:21,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:21,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:22,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838455244] [2025-03-08 00:43:22,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838455244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:22,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934239494] [2025-03-08 00:43:22,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:43:22,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:22,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:22,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:22,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:43:22,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:43:22,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:43:22,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:22,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:22,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:43:22,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:22,140 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-08 00:43:22,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:43:22,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 23 treesize of output 3 [2025-03-08 00:43:22,259 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 19 treesize of output 11 [2025-03-08 00:43:22,297 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-08 00:43:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:22,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:22,436 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 20 treesize of output 18 [2025-03-08 00:43:22,439 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 28 treesize of output 24 [2025-03-08 00:43:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:22,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934239494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:22,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:22,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 25 [2025-03-08 00:43:22,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165736183] [2025-03-08 00:43:22,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:22,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 00:43:22,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:22,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 00:43:22,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2025-03-08 00:43:22,497 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:22,675 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2025-03-08 00:43:22,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 00:43:22,676 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:43:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:22,676 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:43:22,676 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:43:22,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:43:22,678 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:22,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:43:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-08 00:43:22,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 00:43:22,680 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2025-03-08 00:43:22,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:22,680 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 00:43:22,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 00:43:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:43:22,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:22,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:22,687 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-08 00:43:22,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:22,885 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:22,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:22,885 INFO L85 PathProgramCache]: Analyzing trace with hash -838315181, now seen corresponding path program 2 times [2025-03-08 00:43:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:22,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605981631] [2025-03-08 00:43:22,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:43:22,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:22,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 00:43:22,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:43:22,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:43:22,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:22,986 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:22,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605981631] [2025-03-08 00:43:22,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605981631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:22,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865098396] [2025-03-08 00:43:22,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:43:22,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:22,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:22,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:22,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:43:23,024 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-08 00:43:23,039 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:43:23,039 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:43:23,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:23,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:43:23,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:23,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:23,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865098396] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:23,129 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:23,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-08 00:43:23,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061862633] [2025-03-08 00:43:23,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:23,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 00:43:23,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:23,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 00:43:23,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:43:23,132 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:23,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:23,230 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2025-03-08 00:43:23,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:43:23,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:43:23,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:23,231 INFO L225 Difference]: With dead ends: 57 [2025-03-08 00:43:23,231 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 00:43:23,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:43:23,232 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:23,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:23,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 00:43:23,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-03-08 00:43:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2025-03-08 00:43:23,237 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 24 [2025-03-08 00:43:23,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:23,237 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2025-03-08 00:43:23,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:23,237 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2025-03-08 00:43:23,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:43:23,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:23,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:23,243 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-08 00:43:23,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:23,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:23,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:23,438 INFO L85 PathProgramCache]: Analyzing trace with hash -599261616, now seen corresponding path program 3 times [2025-03-08 00:43:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638033889] [2025-03-08 00:43:23,438 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:43:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:23,447 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-08 00:43:23,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:43:23,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:43:23,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638033889] [2025-03-08 00:43:24,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638033889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:24,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191090473] [2025-03-08 00:43:24,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:43:24,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:24,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:24,247 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:24,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:43:24,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-03-08 00:43:24,303 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:43:24,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:43:24,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:24,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 00:43:24,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:24,345 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 1 [2025-03-08 00:43:24,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:43:24,419 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 13 [2025-03-08 00:43:24,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:43:24,646 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 23 treesize of output 3 [2025-03-08 00:43:24,785 INFO L349 Elim1Store]: treesize reduction 17, result has 37.0 percent of original size [2025-03-08 00:43:24,785 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 56 treesize of output 37 [2025-03-08 00:43:24,802 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 36 treesize of output 13 [2025-03-08 00:43:24,895 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-08 00:43:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:24,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:25,437 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 37 treesize of output 33 [2025-03-08 00:43:25,445 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 47 treesize of output 39 [2025-03-08 00:43:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191090473] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:25,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:25,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 47 [2025-03-08 00:43:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575991886] [2025-03-08 00:43:25,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:25,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-08 00:43:25,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:25,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-08 00:43:25,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=1882, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 00:43:25,456 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:27,240 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2025-03-08 00:43:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-03-08 00:43:27,240 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 00:43:27,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:27,242 INFO L225 Difference]: With dead ends: 71 [2025-03-08 00:43:27,242 INFO L226 Difference]: Without dead ends: 58 [2025-03-08 00:43:27,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1019, Invalid=5787, Unknown=0, NotChecked=0, Total=6806 [2025-03-08 00:43:27,244 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 89 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:27,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 81 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:43:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-08 00:43:27,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2025-03-08 00:43:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:27,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-08 00:43:27,251 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2025-03-08 00:43:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:27,251 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-08 00:43:27,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-08 00:43:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:43:27,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:27,252 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:27,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:43:27,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:27,456 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:27,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1695508468, now seen corresponding path program 4 times [2025-03-08 00:43:27,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:27,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003669010] [2025-03-08 00:43:27,456 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:43:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:27,467 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:43:27,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-08 00:43:27,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:43:27,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:27,657 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:27,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003669010] [2025-03-08 00:43:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003669010] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039332995] [2025-03-08 00:43:27,657 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:43:27,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:27,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:27,659 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:27,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:43:27,693 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:43:27,701 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 30 statements. [2025-03-08 00:43:27,701 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:43:27,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:27,702 WARN L254 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-08 00:43:27,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:27,707 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 11 [2025-03-08 00:43:27,736 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 36 treesize of output 16 [2025-03-08 00:43:27,793 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 48 treesize of output 31 [2025-03-08 00:43:27,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:43:27,979 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 23 treesize of output 3 [2025-03-08 00:43:28,047 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 53 treesize of output 30 [2025-03-08 00:43:28,227 INFO L349 Elim1Store]: treesize reduction 26, result has 70.1 percent of original size [2025-03-08 00:43:28,228 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 85 treesize of output 92 [2025-03-08 00:43:28,239 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 38 treesize of output 15 [2025-03-08 00:43:28,361 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-08 00:43:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:28,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039332995] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:28,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 20] total 48 [2025-03-08 00:43:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223645988] [2025-03-08 00:43:28,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:28,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-08 00:43:28,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:28,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-08 00:43:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2004, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 00:43:28,927 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 48 states, 48 states have (on average 1.5625) internal successors, (75), 48 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:35,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:35,017 INFO L93 Difference]: Finished difference Result 176 states and 206 transitions. [2025-03-08 00:43:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-08 00:43:35,018 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 48 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 00:43:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:35,019 INFO L225 Difference]: With dead ends: 176 [2025-03-08 00:43:35,019 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 00:43:35,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9241 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=3316, Invalid=24406, Unknown=0, NotChecked=0, Total=27722 [2025-03-08 00:43:35,023 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 232 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:35,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 148 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 00:43:35,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 00:43:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 67. [2025-03-08 00:43:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2025-03-08 00:43:35,042 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 30 [2025-03-08 00:43:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:35,043 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2025-03-08 00:43:35,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.5625) internal successors, (75), 48 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:35,043 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2025-03-08 00:43:35,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:43:35,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:35,044 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:35,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:43:35,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:35,244 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:35,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1464688459, now seen corresponding path program 5 times [2025-03-08 00:43:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:35,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274228622] [2025-03-08 00:43:35,245 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:43:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:35,253 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 6 equivalence classes. [2025-03-08 00:43:35,275 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 27 of 36 statements. [2025-03-08 00:43:35,279 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:43:35,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:43:35,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274228622] [2025-03-08 00:43:35,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274228622] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:35,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298257949] [2025-03-08 00:43:35,457 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:43:35,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:35,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:35,459 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:35,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:43:35,498 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 6 equivalence classes. [2025-03-08 00:43:35,514 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 27 of 36 statements. [2025-03-08 00:43:35,515 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-08 00:43:35,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:35,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-08 00:43:35,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:35,563 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:43:35,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:43:35,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298257949] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:35,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:35,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-08 00:43:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690339630] [2025-03-08 00:43:35,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:35,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 00:43:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:35,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 00:43:35,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:43:35,619 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:35,735 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2025-03-08 00:43:35,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:43:35,735 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-08 00:43:35,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:35,736 INFO L225 Difference]: With dead ends: 148 [2025-03-08 00:43:35,736 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:43:35,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:43:35,737 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:35,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 37 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:35,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:43:35,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 59. [2025-03-08 00:43:35,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.103448275862069) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2025-03-08 00:43:35,749 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 36 [2025-03-08 00:43:35,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:35,750 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2025-03-08 00:43:35,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:35,750 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2025-03-08 00:43:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 00:43:35,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:35,750 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:35,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:43:35,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:35,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:35,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:35,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1027755379, now seen corresponding path program 6 times [2025-03-08 00:43:35,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:35,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325477979] [2025-03-08 00:43:35,952 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:35,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:35,958 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-03-08 00:43:35,983 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:43:35,983 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:43:35,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:36,081 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 25 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:36,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325477979] [2025-03-08 00:43:36,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325477979] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:36,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498700050] [2025-03-08 00:43:36,081 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:36,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:36,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:36,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:36,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:43:36,130 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 6 equivalence classes. [2025-03-08 00:43:36,153 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 00:43:36,153 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-03-08 00:43:36,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:36,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:43:36,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:36,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 35 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:36,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498700050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:36,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-08 00:43:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14456301] [2025-03-08 00:43:36,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:36,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:43:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:36,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:43:36,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:43:36,290 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:36,429 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2025-03-08 00:43:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:43:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-08 00:43:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:36,429 INFO L225 Difference]: With dead ends: 132 [2025-03-08 00:43:36,430 INFO L226 Difference]: Without dead ends: 91 [2025-03-08 00:43:36,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:43:36,430 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:36,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 24 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-03-08 00:43:36,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 65. [2025-03-08 00:43:36,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.09375) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:36,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2025-03-08 00:43:36,442 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 36 [2025-03-08 00:43:36,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:36,443 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2025-03-08 00:43:36,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0526315789473686) internal successors, (58), 19 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2025-03-08 00:43:36,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:43:36,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:36,443 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:36,449 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-08 00:43:36,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:36,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:36,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash 172013618, now seen corresponding path program 7 times [2025-03-08 00:43:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537032644] [2025-03-08 00:43:36,645 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:43:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:36,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:43:36,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:43:36,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:36,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:36,785 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 22 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:36,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:36,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537032644] [2025-03-08 00:43:36,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537032644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:36,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110556275] [2025-03-08 00:43:36,786 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:43:36,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:36,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:36,787 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:36,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:43:36,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 00:43:36,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:43:36,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:43:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:36,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:43:36,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:36,943 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 35 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110556275] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:37,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:37,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2025-03-08 00:43:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620772234] [2025-03-08 00:43:37,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:37,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:43:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:37,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:43:37,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:43:37,046 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:37,333 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2025-03-08 00:43:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:43:37,333 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-08 00:43:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:37,334 INFO L225 Difference]: With dead ends: 115 [2025-03-08 00:43:37,334 INFO L226 Difference]: Without dead ends: 112 [2025-03-08 00:43:37,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=1144, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 00:43:37,337 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 64 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:37,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 41 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:43:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-08 00:43:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2025-03-08 00:43:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2025-03-08 00:43:37,353 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 39 [2025-03-08 00:43:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:37,353 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2025-03-08 00:43:37,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0869565217391304) internal successors, (71), 23 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2025-03-08 00:43:37,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 00:43:37,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:37,354 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:37,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:43:37,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:43:37,554 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:37,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1630509840, now seen corresponding path program 8 times [2025-03-08 00:43:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:37,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533857746] [2025-03-08 00:43:37,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:43:37,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:37,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:43:37,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:43:37,582 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:43:37,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:38,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:38,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533857746] [2025-03-08 00:43:38,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533857746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:38,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47839612] [2025-03-08 00:43:38,694 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:43:38,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:38,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:38,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:38,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:43:38,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-03-08 00:43:38,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 00:43:38,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:43:38,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:38,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 00:43:38,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:38,851 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-08 00:43:38,900 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 23 treesize of output 11 [2025-03-08 00:43:38,966 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 30 treesize of output 21 [2025-03-08 00:43:39,041 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 37 treesize of output 31 [2025-03-08 00:43:39,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:43:39,221 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 23 treesize of output 3 [2025-03-08 00:43:39,312 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 44 treesize of output 21 [2025-03-08 00:43:39,413 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 50 treesize of output 27 [2025-03-08 00:43:39,508 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 55 treesize of output 32 [2025-03-08 00:43:39,510 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:43:39,510 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 56 treesize of output 24 [2025-03-08 00:43:39,551 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-08 00:43:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:39,574 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:40,347 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 159 treesize of output 151 [2025-03-08 00:43:40,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:43:40,603 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 397123190 treesize of output 380345974 [2025-03-08 00:43:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47839612] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:42,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 64 [2025-03-08 00:43:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052578270] [2025-03-08 00:43:42,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:42,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-08 00:43:42,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:42,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-08 00:43:42,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3611, Unknown=0, NotChecked=0, Total=4032 [2025-03-08 00:43:42,219 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 64 states, 64 states have (on average 1.71875) internal successors, (110), 64 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:43,676 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2025-03-08 00:43:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:43:43,677 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.71875) internal successors, (110), 64 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-08 00:43:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:43,677 INFO L225 Difference]: With dead ends: 100 [2025-03-08 00:43:43,678 INFO L226 Difference]: Without dead ends: 97 [2025-03-08 00:43:43,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2276 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=893, Invalid=6939, Unknown=0, NotChecked=0, Total=7832 [2025-03-08 00:43:43,679 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 91 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:43,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 116 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:43:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-08 00:43:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 63. [2025-03-08 00:43:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.096774193548387) internal successors, (68), 62 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2025-03-08 00:43:43,694 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 39 [2025-03-08 00:43:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:43,694 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2025-03-08 00:43:43,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.71875) internal successors, (110), 64 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2025-03-08 00:43:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-08 00:43:43,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:43,695 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:43,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:43:43,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:43,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:43,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1680735572, now seen corresponding path program 9 times [2025-03-08 00:43:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:43,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117777327] [2025-03-08 00:43:43,896 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:43:43,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:43,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 7 equivalence classes. [2025-03-08 00:43:43,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:43:43,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:43:43,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:44,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117777327] [2025-03-08 00:43:44,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117777327] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:44,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37560767] [2025-03-08 00:43:44,084 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:43:44,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:44,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:44,086 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:44,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:43:44,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 7 equivalence classes. [2025-03-08 00:43:44,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 00:43:44,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-08 00:43:44,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:44,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 00:43:44,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:44,296 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:44,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37560767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:44,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:44,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 22 [2025-03-08 00:43:44,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978625483] [2025-03-08 00:43:44,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:44,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 00:43:44,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:44,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 00:43:44,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-08 00:43:44,389 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:44,557 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2025-03-08 00:43:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:43:44,558 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-03-08 00:43:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:44,559 INFO L225 Difference]: With dead ends: 106 [2025-03-08 00:43:44,559 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 00:43:44,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 66 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:43:44,560 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:44,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 46 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:44,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 00:43:44,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 66. [2025-03-08 00:43:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2025-03-08 00:43:44,580 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 42 [2025-03-08 00:43:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:44,581 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2025-03-08 00:43:44,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 22 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2025-03-08 00:43:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:43:44,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:44,581 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:44,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:43:44,784 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,SelfDestructingSolverStorable12 [2025-03-08 00:43:44,784 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1794651186, now seen corresponding path program 10 times [2025-03-08 00:43:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908224697] [2025-03-08 00:43:44,784 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:43:44,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:44,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:43:44,806 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-08 00:43:44,806 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:43:44,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 38 proven. 62 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:43:45,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908224697] [2025-03-08 00:43:45,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908224697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:45,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122100446] [2025-03-08 00:43:45,866 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:43:45,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:45,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:45,885 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:45,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:43:45,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:43:45,936 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 41 of 45 statements. [2025-03-08 00:43:45,936 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:43:45,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:45,937 WARN L254 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-08 00:43:45,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:45,983 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 23 treesize of output 1 [2025-03-08 00:43:46,035 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 36 treesize of output 16 [2025-03-08 00:43:46,099 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 48 treesize of output 31 [2025-03-08 00:43:46,173 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 60 treesize of output 46 [2025-03-08 00:43:46,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:43:46,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 64 treesize of output 72 [2025-03-08 00:43:46,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:43:46,657 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 23 treesize of output 3 [2025-03-08 00:43:46,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 30 [2025-03-08 00:43:46,941 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 64 treesize of output 41 [2025-03-08 00:43:47,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 51 [2025-03-08 00:43:47,472 INFO L349 Elim1Store]: treesize reduction 92, result has 62.1 percent of original size [2025-03-08 00:43:47,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 129 treesize of output 190 [2025-03-08 00:43:47,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2025-03-08 00:43:47,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 15 treesize of output 7 [2025-03-08 00:43:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 23 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:47,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:49,449 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 23 treesize of output 21 [2025-03-08 00:43:49,452 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 35 treesize of output 28 [2025-03-08 00:43:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 23 proven. 77 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:43:49,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122100446] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:49,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:49,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 30, 31] total 81 [2025-03-08 00:43:49,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209425049] [2025-03-08 00:43:49,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:49,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2025-03-08 00:43:49,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:49,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2025-03-08 00:43:49,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=702, Invalid=5778, Unknown=0, NotChecked=0, Total=6480 [2025-03-08 00:43:49,457 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 81 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 81 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:56,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:56,709 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2025-03-08 00:43:56,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-08 00:43:56,709 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 81 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2025-03-08 00:43:56,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:56,710 INFO L225 Difference]: With dead ends: 113 [2025-03-08 00:43:56,710 INFO L226 Difference]: Without dead ends: 109 [2025-03-08 00:43:56,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 6598 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2761, Invalid=19889, Unknown=0, NotChecked=0, Total=22650 [2025-03-08 00:43:56,712 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 166 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:56,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 126 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 00:43:56,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-08 00:43:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 66. [2025-03-08 00:43:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2025-03-08 00:43:56,733 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 45 [2025-03-08 00:43:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:56,733 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2025-03-08 00:43:56,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 81 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2025-03-08 00:43:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-08 00:43:56,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:56,733 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:56,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:43:56,934 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,SelfDestructingSolverStorable13 [2025-03-08 00:43:56,934 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:56,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:56,935 INFO L85 PathProgramCache]: Analyzing trace with hash 819842770, now seen corresponding path program 11 times [2025-03-08 00:43:56,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:56,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944032754] [2025-03-08 00:43:56,935 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:43:56,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:56,940 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 8 equivalence classes. [2025-03-08 00:43:56,963 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:43:56,963 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 00:43:56,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 59 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944032754] [2025-03-08 00:43:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944032754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134215849] [2025-03-08 00:43:57,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:43:57,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:57,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:57,130 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:57,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:43:57,182 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 48 statements into 8 equivalence classes. [2025-03-08 00:43:57,255 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) and asserted 48 of 48 statements. [2025-03-08 00:43:57,255 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2025-03-08 00:43:57,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:57,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 00:43:57,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 70 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:57,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:43:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 59 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:57,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134215849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:43:57,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:43:57,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 24 [2025-03-08 00:43:57,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146607958] [2025-03-08 00:43:57,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:43:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:43:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:43:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:43:57,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:43:57,548 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:57,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:43:57,738 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2025-03-08 00:43:57,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:43:57,738 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-08 00:43:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:43:57,739 INFO L225 Difference]: With dead ends: 115 [2025-03-08 00:43:57,739 INFO L226 Difference]: Without dead ends: 90 [2025-03-08 00:43:57,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 75 SyntacticMatches, 14 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2025-03-08 00:43:57,739 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 58 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:43:57,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:43:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-08 00:43:57,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 69. [2025-03-08 00:43:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2025-03-08 00:43:57,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 48 [2025-03-08 00:43:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:43:57,760 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2025-03-08 00:43:57,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.75) internal successors, (66), 24 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:43:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2025-03-08 00:43:57,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 00:43:57,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:43:57,761 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:43:57,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-08 00:43:57,963 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,SelfDestructingSolverStorable14 [2025-03-08 00:43:57,963 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:43:57,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:43:57,963 INFO L85 PathProgramCache]: Analyzing trace with hash 564131825, now seen corresponding path program 12 times [2025-03-08 00:43:57,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:43:57,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241728807] [2025-03-08 00:43:57,963 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:57,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:43:57,969 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 8 equivalence classes. [2025-03-08 00:43:58,013 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:43:58,013 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:43:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:43:59,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:43:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241728807] [2025-03-08 00:43:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241728807] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:43:59,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721881447] [2025-03-08 00:43:59,750 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:43:59,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:43:59,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:43:59,752 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:43:59,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:43:59,799 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 51 statements into 8 equivalence classes. [2025-03-08 00:43:59,845 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 00:43:59,846 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-08 00:43:59,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:43:59,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-08 00:43:59,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:43:59,864 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-08 00:43:59,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-08 00:43:59,995 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 30 treesize of output 21 [2025-03-08 00:44:00,072 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 37 treesize of output 31 [2025-03-08 00:44:00,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:44:00,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 50 [2025-03-08 00:44:00,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:00,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:44:00,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 64 [2025-03-08 00:44:00,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-08 00:44:00,618 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 23 treesize of output 3 [2025-03-08 00:44:00,757 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 38 treesize of output 15 [2025-03-08 00:44:00,842 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 44 treesize of output 21 [2025-03-08 00:44:01,006 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 50 treesize of output 27 [2025-03-08 00:44:01,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2025-03-08 00:44:01,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:44:01,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:44:01,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 17 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 137 [2025-03-08 00:44:01,353 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 40 treesize of output 17 [2025-03-08 00:44:01,826 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-08 00:44:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:44:01,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:44:03,983 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 219 treesize of output 211 [2025-03-08 00:44:09,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:44:09,906 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 -7835633063966015498 treesize of output -7979748252041871370