./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array5_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array5_pattern.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 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:30:41,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:30:41,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:30:41,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:30:41,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:30:41,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:30:41,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:30:41,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:30:41,346 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:30:41,347 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:30:41,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:30:41,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:30:41,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:30:41,348 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:30:41,348 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:30:41,348 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:30:41,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:30:41,348 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:30:41,349 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:30:41,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:30:41,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:30:41,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:30:41,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:30:41,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:30:41,350 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:30:41,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:30:41,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:30:41,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:30:41,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:30:41,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:30:41,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:30:41,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:30:41,351 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 -> 3dd3ea9d30e76cbd39a744e53feb2b89c359b5b85c7df24161ceaf060cda3b02 [2025-03-03 09:30:41,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:30:41,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:30:41,581 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:30:41,582 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:30:41,582 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:30:41,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array5_pattern.c [2025-03-03 09:30:42,674 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c27f2b5/40af3fb81910477389dcc2d1fda06abe/FLAG6daee7519 [2025-03-03 09:30:42,867 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:30:42,876 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array5_pattern.c [2025-03-03 09:30:42,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c27f2b5/40af3fb81910477389dcc2d1fda06abe/FLAG6daee7519 [2025-03-03 09:30:43,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9c27f2b5/40af3fb81910477389dcc2d1fda06abe [2025-03-03 09:30:43,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:30:43,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:30:43,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:30:43,230 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:30:43,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:30:43,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d7e71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43, skipping insertion in model container [2025-03-03 09:30:43,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:30:43,333 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-patterns/array5_pattern.c[1890,1903] [2025-03-03 09:30:43,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:30:43,357 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:30:43,365 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-patterns/array5_pattern.c[1890,1903] [2025-03-03 09:30:43,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:30:43,385 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:30:43,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43 WrapperNode [2025-03-03 09:30:43,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:30:43,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:30:43,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:30:43,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:30:43,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,410 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2025-03-03 09:30:43,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:30:43,412 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:30:43,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:30:43,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:30:43,417 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,422 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,431 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 3, 3]. [2025-03-03 09:30:43,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,440 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:30:43,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:30:43,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:30:43,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:30:43,447 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (1/1) ... [2025-03-03 09:30:43,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:30:43,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:43,468 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:30:43,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:30:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:30:43,485 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 09:30:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:30:43,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:30:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:30:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:30:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:30:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:30:43,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:30:43,542 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:30:43,543 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:30:43,640 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L52: call ULTIMATE.dealloc(main_~#array1~0#1.base, main_~#array1~0#1.offset);havoc main_~#array1~0#1.base, main_~#array1~0#1.offset;call ULTIMATE.dealloc(main_~#array2~0#1.base, main_~#array2~0#1.offset);havoc main_~#array2~0#1.base, main_~#array2~0#1.offset; [2025-03-03 09:30:43,646 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 09:30:43,646 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:30:43,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:30:43,652 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:30:43,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:43 BoogieIcfgContainer [2025-03-03 09:30:43,652 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:30:43,653 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:30:43,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:30:43,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:30:43,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:30:43" (1/3) ... [2025-03-03 09:30:43,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412e80ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:43, skipping insertion in model container [2025-03-03 09:30:43,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:30:43" (2/3) ... [2025-03-03 09:30:43,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@412e80ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:30:43, skipping insertion in model container [2025-03-03 09:30:43,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:30:43" (3/3) ... [2025-03-03 09:30:43,657 INFO L128 eAbstractionObserver]: Analyzing ICFG array5_pattern.c [2025-03-03 09:30:43,666 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:30:43,667 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array5_pattern.c that has 2 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:30:43,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:30:43,712 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;@233bc37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:30:43,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:30:43,714 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:43,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:30:43,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:43,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:43,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:43,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:43,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1225606633, now seen corresponding path program 1 times [2025-03-03 09:30:43,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:43,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081153089] [2025-03-03 09:30:43,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:43,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:43,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 09:30:43,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:30:43,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:43,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081153089] [2025-03-03 09:30:43,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081153089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:30:43,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:30:43,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:30:43,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7947274] [2025-03-03 09:30:43,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:30:43,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:30:43,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:43,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:30:43,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:30:43,828 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:30:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:43,838 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2025-03-03 09:30:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:30:43,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-03 09:30:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:43,843 INFO L225 Difference]: With dead ends: 45 [2025-03-03 09:30:43,843 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:30:43,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:30:43,848 INFO L435 NwaCegarLoop]: 29 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, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:30:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:30:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 09:30:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-03 09:30:43,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 14 [2025-03-03 09:30:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:43,868 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-03 09:30:43,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:30:43,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-03 09:30:43,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:30:43,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:43,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:43,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:30:43,870 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:43,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash -958553730, now seen corresponding path program 1 times [2025-03-03 09:30:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732626712] [2025-03-03 09:30:43,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:43,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:30:43,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:30:43,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:43,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:44,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:44,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732626712] [2025-03-03 09:30:44,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732626712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:30:44,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:30:44,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:30:44,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091002128] [2025-03-03 09:30:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:30:44,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:30:44,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:44,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:30:44,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:30:44,006 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:44,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:44,046 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2025-03-03 09:30:44,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:30:44,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-03 09:30:44,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:44,047 INFO L225 Difference]: With dead ends: 40 [2025-03-03 09:30:44,048 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:30:44,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:30:44,048 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:44,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:30:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:30:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2025-03-03 09:30:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:30:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2025-03-03 09:30:44,053 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 23 [2025-03-03 09:30:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:44,053 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2025-03-03 09:30:44,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:44,054 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2025-03-03 09:30:44,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 09:30:44,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:44,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:44,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:30:44,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -71050049, now seen corresponding path program 1 times [2025-03-03 09:30:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341455541] [2025-03-03 09:30:44,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:44,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 09:30:44,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 09:30:44,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:44,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341455541] [2025-03-03 09:30:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341455541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:30:44,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:30:44,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:30:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320452378] [2025-03-03 09:30:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:30:44,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:30:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:44,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:30:44,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:30:44,188 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:44,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:44,203 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2025-03-03 09:30:44,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:30:44,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-03 09:30:44,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:44,205 INFO L225 Difference]: With dead ends: 28 [2025-03-03 09:30:44,205 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 09:30:44,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:30:44,207 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 4 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:44,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:30:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 09:30:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-03 09:30:44,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:30:44,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2025-03-03 09:30:44,225 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 23 [2025-03-03 09:30:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:44,225 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2025-03-03 09:30:44,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2025-03-03 09:30:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:30:44,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:44,226 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:44,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:30:44,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:44,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash 2092447530, now seen corresponding path program 1 times [2025-03-03 09:30:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:44,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880340698] [2025-03-03 09:30:44,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:44,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:44,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:30:44,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:30:44,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:44,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:44,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:44,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880340698] [2025-03-03 09:30:44,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880340698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:30:44,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:30:44,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 09:30:44,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176597772] [2025-03-03 09:30:44,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:30:44,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 09:30:44,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:44,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 09:30:44,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:30:44,335 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:44,390 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2025-03-03 09:30:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 09:30:44,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2025-03-03 09:30:44,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:44,391 INFO L225 Difference]: With dead ends: 48 [2025-03-03 09:30:44,391 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 09:30:44,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:30:44,392 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:44,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 54 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:30:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 09:30:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2025-03-03 09:30:44,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:30:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2025-03-03 09:30:44,396 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 24 [2025-03-03 09:30:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:44,396 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2025-03-03 09:30:44,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2025-03-03 09:30:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:30:44,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:44,397 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:44,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:30:44,397 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:44,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:44,397 INFO L85 PathProgramCache]: Analyzing trace with hash 554131280, now seen corresponding path program 1 times [2025-03-03 09:30:44,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:44,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660022947] [2025-03-03 09:30:44,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:44,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:44,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:30:44,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:30:44,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:44,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:30:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608016963] [2025-03-03 09:30:44,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:44,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:44,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:44,450 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:44,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:30:44,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:30:44,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:30:44,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:44,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:44,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-03 09:30:44,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:44,686 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 9 [2025-03-03 09:30:44,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:30:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:44,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:44,821 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 34 treesize of output 32 [2025-03-03 09:30:44,824 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 32 treesize of output 30 [2025-03-03 09:30:44,826 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 52 treesize of output 50 [2025-03-03 09:30:45,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:30:45,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:45,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660022947] [2025-03-03 09:30:45,100 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:30:45,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608016963] [2025-03-03 09:30:45,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608016963] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:45,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:30:45,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2025-03-03 09:30:45,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717113777] [2025-03-03 09:30:45,100 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:45,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:30:45,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:45,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:30:45,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:30:45,105 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:30:45,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:45,577 INFO L93 Difference]: Finished difference Result 87 states and 113 transitions. [2025-03-03 09:30:45,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 09:30:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2025-03-03 09:30:45,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:45,579 INFO L225 Difference]: With dead ends: 87 [2025-03-03 09:30:45,579 INFO L226 Difference]: Without dead ends: 69 [2025-03-03 09:30:45,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 09:30:45,580 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 62 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:45,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 201 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:30:45,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-03 09:30:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2025-03-03 09:30:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-03 09:30:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 72 transitions. [2025-03-03 09:30:45,587 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 72 transitions. Word has length 25 [2025-03-03 09:30:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:45,587 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 72 transitions. [2025-03-03 09:30:45,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:30:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 72 transitions. [2025-03-03 09:30:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:30:45,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:45,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:45,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:45,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:45,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:45,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:45,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1767751, now seen corresponding path program 2 times [2025-03-03 09:30:45,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:45,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169312292] [2025-03-03 09:30:45,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:30:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:45,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:30:45,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:30:45,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:30:45,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:45,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:45,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169312292] [2025-03-03 09:30:45,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169312292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:45,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593063184] [2025-03-03 09:30:45,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:30:45,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:45,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:45,879 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:45,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:30:45,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-03 09:30:45,927 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:30:45,927 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:30:45,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:45,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:30:45,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:45,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:46,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593063184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:46,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:46,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:30:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616605946] [2025-03-03 09:30:46,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:46,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:30:46,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:46,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:30:46,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:30:46,016 INFO L87 Difference]: Start difference. First operand 54 states and 72 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:30:46,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:46,134 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2025-03-03 09:30:46,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:30:46,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-03 09:30:46,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:46,135 INFO L225 Difference]: With dead ends: 120 [2025-03-03 09:30:46,136 INFO L226 Difference]: Without dead ends: 82 [2025-03-03 09:30:46,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:30:46,136 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:46,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 98 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-03 09:30:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 69. [2025-03-03 09:30:46,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:30:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2025-03-03 09:30:46,147 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 26 [2025-03-03 09:30:46,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:46,147 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2025-03-03 09:30:46,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:30:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2025-03-03 09:30:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:30:46,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:46,149 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:46,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:30:46,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 09:30:46,349 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:46,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:46,350 INFO L85 PathProgramCache]: Analyzing trace with hash 110967786, now seen corresponding path program 3 times [2025-03-03 09:30:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676324704] [2025-03-03 09:30:46,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:30:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:46,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 09:30:46,369 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:30:46,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:30:46,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:46,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676324704] [2025-03-03 09:30:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676324704] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:46,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124268711] [2025-03-03 09:30:46,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:30:46,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:46,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:46,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:46,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:30:46,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-03 09:30:46,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 26 statements. [2025-03-03 09:30:46,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:30:46,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:46,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 09:30:46,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:46,562 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-03 09:30:46,566 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 13 [2025-03-03 09:30:46,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:46,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2025-03-03 09:30:46,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:46,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 24 [2025-03-03 09:30:46,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:46,773 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:46,915 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 42 treesize of output 40 [2025-03-03 09:30:46,919 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 40 treesize of output 38 [2025-03-03 09:30:46,922 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 64 treesize of output 58 [2025-03-03 09:30:46,926 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 76 treesize of output 64 [2025-03-03 09:30:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:47,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124268711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:47,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:47,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 11] total 24 [2025-03-03 09:30:47,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637382920] [2025-03-03 09:30:47,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:47,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:30:47,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:47,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:30:47,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:30:47,083 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 09:30:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:47,988 INFO L93 Difference]: Finished difference Result 137 states and 178 transitions. [2025-03-03 09:30:47,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:30:47,988 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2025-03-03 09:30:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:47,989 INFO L225 Difference]: With dead ends: 137 [2025-03-03 09:30:47,989 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 09:30:47,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=438, Invalid=1818, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 09:30:47,991 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 119 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:47,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 233 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:30:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 09:30:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2025-03-03 09:30:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:30:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2025-03-03 09:30:47,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 26 [2025-03-03 09:30:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:47,996 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2025-03-03 09:30:47,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 22 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 09:30:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2025-03-03 09:30:47,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:30:47,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:47,997 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:48,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:48,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:48,198 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:48,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash -854934177, now seen corresponding path program 4 times [2025-03-03 09:30:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:48,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080945243] [2025-03-03 09:30:48,199 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:30:48,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:48,205 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:30:48,227 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:30:48,227 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:30:48,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:30:48,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [566050852] [2025-03-03 09:30:48,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:30:48,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:48,230 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:48,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:30:48,266 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-03 09:30:48,286 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:30:48,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:30:48,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:48,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-03 09:30:48,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:48,315 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-03 09:30:48,319 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-03 09:30:48,350 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 25 treesize of output 24 [2025-03-03 09:30:48,356 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 25 treesize of output 24 [2025-03-03 09:30:48,612 INFO L349 Elim1Store]: treesize reduction 36, result has 49.3 percent of original size [2025-03-03 09:30:48,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 50 [2025-03-03 09:30:48,640 INFO L349 Elim1Store]: treesize reduction 40, result has 46.7 percent of original size [2025-03-03 09:30:48,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 52 [2025-03-03 09:30:49,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:49,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:49,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 164 treesize of output 170 [2025-03-03 09:30:49,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:49,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:49,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 155 treesize of output 145 [2025-03-03 09:30:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:50,379 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080945243] [2025-03-03 09:30:50,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:30:50,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566050852] [2025-03-03 09:30:50,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566050852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:50,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:30:50,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2025-03-03 09:30:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170444999] [2025-03-03 09:30:50,528 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:50,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:30:50,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:50,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:30:50,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:30:50,529 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:50,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:50,776 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2025-03-03 09:30:50,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:30:50,777 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-03 09:30:50,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:50,777 INFO L225 Difference]: With dead ends: 54 [2025-03-03 09:30:50,777 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 09:30:50,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:30:50,778 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 21 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:50,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 133 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:30:50,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 09:30:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-03-03 09:30:50,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 09:30:50,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-03-03 09:30:50,790 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 27 [2025-03-03 09:30:50,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:50,791 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-03 09:30:50,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:50,791 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-03-03 09:30:50,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:30:50,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:50,792 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:50,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:50,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:50,998 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:50,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1051447682, now seen corresponding path program 1 times [2025-03-03 09:30:50,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:50,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117191195] [2025-03-03 09:30:50,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:50,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:51,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:30:51,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:30:51,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:51,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:30:51,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1387594942] [2025-03-03 09:30:51,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:30:51,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:51,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:51,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:51,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:30:51,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:30:51,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:30:51,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:51,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:51,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-03 09:30:51,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:51,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:30:51,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:30:51,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:30:51,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:30:51,401 INFO L349 Elim1Store]: treesize reduction 80, result has 36.0 percent of original size [2025-03-03 09:30:51,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 66 [2025-03-03 09:30:51,439 INFO L349 Elim1Store]: treesize reduction 88, result has 33.8 percent of original size [2025-03-03 09:30:51,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 68 [2025-03-03 09:30:51,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:51,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63 [2025-03-03 09:30:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:51,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117191195] [2025-03-03 09:30:51,831 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:30:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387594942] [2025-03-03 09:30:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387594942] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:51,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:30:51,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-03-03 09:30:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157577788] [2025-03-03 09:30:51,832 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:30:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:51,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:30:51,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:30:51,832 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:52,022 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-03-03 09:30:52,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:30:52,023 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-03 09:30:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:52,024 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:30:52,024 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 09:30:52,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:30:52,024 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:52,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 126 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 09:30:52,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2025-03-03 09:30:52,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:30:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2025-03-03 09:30:52,035 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 27 [2025-03-03 09:30:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:52,036 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2025-03-03 09:30:52,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2025-03-03 09:30:52,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:30:52,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:52,037 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:52,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:52,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:52,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -733123958, now seen corresponding path program 5 times [2025-03-03 09:30:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699758334] [2025-03-03 09:30:52,238 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:30:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:52,244 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-03 09:30:52,255 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:30:52,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:30:52,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:52,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:52,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699758334] [2025-03-03 09:30:52,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699758334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:52,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553011201] [2025-03-03 09:30:52,327 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:30:52,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:52,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:52,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:52,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:30:52,362 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-03 09:30:52,376 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:30:52,376 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:30:52,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:52,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:30:52,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:52,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:52,445 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:52,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553011201] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:52,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:52,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:30:52,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744512229] [2025-03-03 09:30:52,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:52,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:30:52,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:52,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:30:52,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:30:52,447 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:30:52,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:52,545 INFO L93 Difference]: Finished difference Result 128 states and 161 transitions. [2025-03-03 09:30:52,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:30:52,545 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-03 09:30:52,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:52,546 INFO L225 Difference]: With dead ends: 128 [2025-03-03 09:30:52,546 INFO L226 Difference]: Without dead ends: 101 [2025-03-03 09:30:52,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:30:52,546 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 101 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:52,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 89 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-03 09:30:52,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2025-03-03 09:30:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:30:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2025-03-03 09:30:52,558 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 28 [2025-03-03 09:30:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:52,559 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2025-03-03 09:30:52,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:30:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2025-03-03 09:30:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:30:52,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:52,559 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:52,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:30:52,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:52,760 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:52,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1729803112, now seen corresponding path program 2 times [2025-03-03 09:30:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378379966] [2025-03-03 09:30:52,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:30:52,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:52,766 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:30:52,771 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:30:52,771 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:30:52,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:52,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:52,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378379966] [2025-03-03 09:30:52,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378379966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:52,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725038034] [2025-03-03 09:30:52,846 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:30:52,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:52,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:52,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:52,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:30:52,886 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:30:52,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:30:52,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:30:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:52,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:30:52,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:52,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725038034] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:53,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:53,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:30:53,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677667189] [2025-03-03 09:30:53,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:30:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:53,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:30:53,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:30:53,002 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:30:53,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:53,167 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2025-03-03 09:30:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:30:53,167 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-03 09:30:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:53,168 INFO L225 Difference]: With dead ends: 102 [2025-03-03 09:30:53,168 INFO L226 Difference]: Without dead ends: 99 [2025-03-03 09:30:53,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:30:53,169 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:53,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 157 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:30:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-03 09:30:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2025-03-03 09:30:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 70 states have internal predecessors, (87), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:30:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 105 transitions. [2025-03-03 09:30:53,180 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 105 transitions. Word has length 28 [2025-03-03 09:30:53,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:53,181 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 105 transitions. [2025-03-03 09:30:53,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:30:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 105 transitions. [2025-03-03 09:30:53,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:30:53,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:53,181 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:53,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:30:53,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:53,382 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:53,382 INFO L85 PathProgramCache]: Analyzing trace with hash -287305808, now seen corresponding path program 6 times [2025-03-03 09:30:53,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:53,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050766336] [2025-03-03 09:30:53,382 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:30:53,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:53,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-03-03 09:30:53,418 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:30:53,418 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:30:53,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:30:53,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1956509319] [2025-03-03 09:30:53,419 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:30:53,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:53,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:53,422 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:53,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:30:53,460 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-03-03 09:30:53,480 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:30:53,480 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:30:53,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:53,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-03 09:30:53,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:53,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:30:53,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:30:53,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:30:53,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:30:53,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:53,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:30:53,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:53,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:30:53,784 INFO L349 Elim1Store]: treesize reduction 42, result has 44.7 percent of original size [2025-03-03 09:30:53,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 54 [2025-03-03 09:30:53,815 INFO L349 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2025-03-03 09:30:53,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 52 [2025-03-03 09:30:54,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:54,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 174 [2025-03-03 09:30:54,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:54,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 125 [2025-03-03 09:30:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:54,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050766336] [2025-03-03 09:30:55,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:30:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956509319] [2025-03-03 09:30:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956509319] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:55,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:30:55,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2025-03-03 09:30:55,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685153143] [2025-03-03 09:30:55,970 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:55,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:30:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:55,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:30:55,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:30:55,971 INFO L87 Difference]: Start difference. First operand 84 states and 105 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:56,182 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2025-03-03 09:30:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:30:56,183 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-03 09:30:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:56,183 INFO L225 Difference]: With dead ends: 103 [2025-03-03 09:30:56,183 INFO L226 Difference]: Without dead ends: 100 [2025-03-03 09:30:56,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:30:56,184 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:56,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 153 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:30:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-03 09:30:56,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2025-03-03 09:30:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:30:56,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2025-03-03 09:30:56,204 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 29 [2025-03-03 09:30:56,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:56,204 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2025-03-03 09:30:56,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:56,205 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2025-03-03 09:30:56,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:30:56,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:56,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:56,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:30:56,412 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,SelfDestructingSolverStorable11 [2025-03-03 09:30:56,412 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:56,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:56,412 INFO L85 PathProgramCache]: Analyzing trace with hash -2084257167, now seen corresponding path program 3 times [2025-03-03 09:30:56,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:56,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689071511] [2025-03-03 09:30:56,413 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:30:56,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:56,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-03 09:30:56,458 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:30:56,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:30:56,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:30:56,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995363588] [2025-03-03 09:30:56,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:30:56,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:56,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:56,462 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:56,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:30:56,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-03-03 09:30:56,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:30:56,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:30:56,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:56,528 WARN L254 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-03 09:30:56,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:56,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:30:56,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:30:56,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:30:56,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:30:56,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:56,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:56,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:56,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 09:30:56,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:56,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:56,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:56,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 09:30:56,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:56,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:56,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:56,999 INFO L349 Elim1Store]: treesize reduction 131, result has 32.1 percent of original size [2025-03-03 09:30:56,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 68 treesize of output 109 [2025-03-03 09:30:57,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:57,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:57,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:57,049 INFO L349 Elim1Store]: treesize reduction 123, result has 33.5 percent of original size [2025-03-03 09:30:57,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 68 treesize of output 107 [2025-03-03 09:30:57,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:57,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:57,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:57,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 202 treesize of output 205 [2025-03-03 09:30:57,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:57,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:30:57,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:30:57,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 176 treesize of output 163 [2025-03-03 09:30:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:58,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:58,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:58,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689071511] [2025-03-03 09:30:58,815 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:30:58,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995363588] [2025-03-03 09:30:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995363588] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:58,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:30:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-03 09:30:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478294485] [2025-03-03 09:30:58,815 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:58,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:30:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:58,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:30:58,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:30:58,817 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:59,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:30:59,343 INFO L93 Difference]: Finished difference Result 108 states and 134 transitions. [2025-03-03 09:30:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 09:30:59,344 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-03 09:30:59,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:30:59,345 INFO L225 Difference]: With dead ends: 108 [2025-03-03 09:30:59,345 INFO L226 Difference]: Without dead ends: 105 [2025-03-03 09:30:59,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 09:30:59,345 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:30:59,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 242 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:30:59,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-03 09:30:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2025-03-03 09:30:59,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 75 states have internal predecessors, (95), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:30:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2025-03-03 09:30:59,359 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 29 [2025-03-03 09:30:59,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:30:59,359 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2025-03-03 09:30:59,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 17 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:30:59,360 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2025-03-03 09:30:59,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:30:59,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:30:59,360 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:30:59,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:30:59,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:30:59,561 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:30:59,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:30:59,561 INFO L85 PathProgramCache]: Analyzing trace with hash -316513703, now seen corresponding path program 7 times [2025-03-03 09:30:59,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:30:59,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210253403] [2025-03-03 09:30:59,561 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:30:59,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:30:59,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:30:59,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:30:59,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:59,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:59,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:30:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210253403] [2025-03-03 09:30:59,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210253403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:30:59,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979381736] [2025-03-03 09:30:59,670 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:30:59,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:30:59,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:30:59,672 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:30:59,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:30:59,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:30:59,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:30:59,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:30:59,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:30:59,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:30:59,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:30:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:30:59,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:30:59,833 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:30:59,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979381736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:30:59,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:30:59,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-03 09:30:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485252442] [2025-03-03 09:30:59,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:30:59,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:30:59,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:30:59,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:30:59,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:30:59,834 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:31:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:31:00,010 INFO L93 Difference]: Finished difference Result 231 states and 299 transitions. [2025-03-03 09:31:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:31:00,010 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-03 09:31:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:31:00,011 INFO L225 Difference]: With dead ends: 231 [2025-03-03 09:31:00,011 INFO L226 Difference]: Without dead ends: 170 [2025-03-03 09:31:00,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:31:00,012 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 216 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:31:00,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 138 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:31:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-03 09:31:00,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2025-03-03 09:31:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 119 states have internal predecessors, (154), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:31:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 186 transitions. [2025-03-03 09:31:00,034 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 186 transitions. Word has length 30 [2025-03-03 09:31:00,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:31:00,035 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 186 transitions. [2025-03-03 09:31:00,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:31:00,035 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 186 transitions. [2025-03-03 09:31:00,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:31:00,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:31:00,035 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:31:00,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:31:00,235 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,SelfDestructingSolverStorable13 [2025-03-03 09:31:00,236 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:31:00,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:31:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1382001153, now seen corresponding path program 8 times [2025-03-03 09:31:00,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:31:00,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736427526] [2025-03-03 09:31:00,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:31:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:31:00,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:31:00,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:31:00,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:31:00,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:31:00,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2010318247] [2025-03-03 09:31:00,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:31:00,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:31:00,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:31:00,254 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:31:00,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:31:00,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:31:00,312 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:31:00,312 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:31:00,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:31:00,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-03 09:31:00,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:31:00,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:31:00,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:31:00,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:31:00,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:31:00,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:00,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:31:00,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:00,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:31:00,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:00,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:31:00,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:00,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:31:00,838 INFO L349 Elim1Store]: treesize reduction 160, result has 35.7 percent of original size [2025-03-03 09:31:00,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 70 treesize of output 122 [2025-03-03 09:31:00,904 INFO L349 Elim1Store]: treesize reduction 176, result has 33.6 percent of original size [2025-03-03 09:31:00,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 70 treesize of output 124 [2025-03-03 09:31:02,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:02,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 318 treesize of output 252 [2025-03-03 09:31:02,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:02,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 223 treesize of output 177 [2025-03-03 09:31:03,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:31:03,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:31:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:31:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736427526] [2025-03-03 09:31:12,508 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:31:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010318247] [2025-03-03 09:31:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010318247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:31:12,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:31:12,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-03-03 09:31:12,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226757755] [2025-03-03 09:31:12,508 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:31:12,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:31:12,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:31:12,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:31:12,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:31:12,509 INFO L87 Difference]: Start difference. First operand 143 states and 186 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:31:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:31:12,906 INFO L93 Difference]: Finished difference Result 164 states and 210 transitions. [2025-03-03 09:31:12,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:31:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-03 09:31:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:31:12,907 INFO L225 Difference]: With dead ends: 164 [2025-03-03 09:31:12,907 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 09:31:12,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:31:12,908 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:31:12,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 243 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:31:12,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 09:31:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2025-03-03 09:31:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 124 states have (on average 1.2903225806451613) internal successors, (160), 124 states have internal predecessors, (160), 16 states have call successors, (16), 7 states have call predecessors, (16), 7 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-03 09:31:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2025-03-03 09:31:12,934 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 31 [2025-03-03 09:31:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:31:12,934 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2025-03-03 09:31:12,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:31:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2025-03-03 09:31:12,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-03 09:31:12,934 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:31:12,935 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:31:12,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 09:31:13,135 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,SelfDestructingSolverStorable14 [2025-03-03 09:31:13,135 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:31:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:31:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1252918434, now seen corresponding path program 4 times [2025-03-03 09:31:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:31:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348189752] [2025-03-03 09:31:13,136 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:31:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:31:13,140 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:31:13,162 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:31:13,162 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:31:13,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:31:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537425263] [2025-03-03 09:31:13,163 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:31:13,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:31:13,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:31:13,165 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:31:13,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:31:13,217 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-03-03 09:31:13,263 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-03 09:31:13,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:31:13,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:31:13,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-03 09:31:13,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:31:13,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:31:13,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:31:13,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:31:13,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:31:13,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:13,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:31:13,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:13,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:31:13,420 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:13,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:31:13,437 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:13,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:31:13,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:13,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:13,694 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2025-03-03 09:31:13,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 70 [2025-03-03 09:31:13,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:13,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:13,716 INFO L349 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2025-03-03 09:31:13,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 72 [2025-03-03 09:31:14,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:14,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 156 treesize of output 158 [2025-03-03 09:31:14,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:14,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 129 [2025-03-03 09:31:14,698 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:31:14,698 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:31:14,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:31:14,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348189752] [2025-03-03 09:31:14,937 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:31:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537425263] [2025-03-03 09:31:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537425263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:31:14,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:31:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-03 09:31:14,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823236185] [2025-03-03 09:31:14,937 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:31:14,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:31:14,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:31:14,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:31:14,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:31:14,938 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:31:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:31:15,325 INFO L93 Difference]: Finished difference Result 178 states and 227 transitions. [2025-03-03 09:31:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 09:31:15,325 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-03 09:31:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:31:15,326 INFO L225 Difference]: With dead ends: 178 [2025-03-03 09:31:15,326 INFO L226 Difference]: Without dead ends: 175 [2025-03-03 09:31:15,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:31:15,327 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 19 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:31:15,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 188 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:31:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-03-03 09:31:15,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 156. [2025-03-03 09:31:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.2923076923076924) internal successors, (168), 130 states have internal predecessors, (168), 17 states have call successors, (17), 8 states have call predecessors, (17), 8 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-03 09:31:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 202 transitions. [2025-03-03 09:31:15,358 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 202 transitions. Word has length 31 [2025-03-03 09:31:15,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:31:15,358 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 202 transitions. [2025-03-03 09:31:15,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 09:31:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 202 transitions. [2025-03-03 09:31:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:31:15,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:31:15,359 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:31:15,370 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-03 09:31:15,559 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,SelfDestructingSolverStorable15 [2025-03-03 09:31:15,559 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:31:15,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:31:15,560 INFO L85 PathProgramCache]: Analyzing trace with hash 107668970, now seen corresponding path program 9 times [2025-03-03 09:31:15,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:31:15,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535985454] [2025-03-03 09:31:15,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:31:15,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:31:15,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-03 09:31:15,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:31:15,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:31:15,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:31:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:31:15,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:31:15,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535985454] [2025-03-03 09:31:15,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535985454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:31:15,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063562400] [2025-03-03 09:31:15,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:31:15,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:31:15,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:31:15,703 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:31:15,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:31:15,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 4 equivalence classes. [2025-03-03 09:31:15,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:31:15,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:31:15,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:31:15,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:31:15,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:31:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:31:15,846 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:31:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:31:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063562400] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:31:15,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:31:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-03 09:31:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42911716] [2025-03-03 09:31:15,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:31:15,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:31:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:31:15,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:31:15,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:31:15,912 INFO L87 Difference]: Start difference. First operand 156 states and 202 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:31:16,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:31:16,221 INFO L93 Difference]: Finished difference Result 387 states and 511 transitions. [2025-03-03 09:31:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:31:16,221 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-03 09:31:16,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:31:16,223 INFO L225 Difference]: With dead ends: 387 [2025-03-03 09:31:16,223 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 09:31:16,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=237, Invalid=633, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:31:16,224 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 362 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:31:16,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 153 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:31:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 09:31:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 216. [2025-03-03 09:31:16,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 181 states have (on average 1.3093922651933703) internal successors, (237), 181 states have internal predecessors, (237), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 09:31:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 287 transitions. [2025-03-03 09:31:16,260 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 287 transitions. Word has length 32 [2025-03-03 09:31:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:31:16,260 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 287 transitions. [2025-03-03 09:31:16,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:31:16,260 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 287 transitions. [2025-03-03 09:31:16,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:31:16,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:31:16,261 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:31:16,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-03 09:31:16,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:31:16,461 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:31:16,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:31:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash 76708984, now seen corresponding path program 5 times [2025-03-03 09:31:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:31:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793156794] [2025-03-03 09:31:16,462 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:31:16,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:31:16,466 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-03 09:31:16,474 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:31:16,474 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:31:16,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:31:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:31:16,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:31:16,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793156794] [2025-03-03 09:31:16,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793156794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:31:16,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689271659] [2025-03-03 09:31:16,582 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:31:16,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:31:16,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:31:16,587 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:31:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:31:16,635 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 32 statements into 5 equivalence classes. [2025-03-03 09:31:16,687 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:31:16,687 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:31:16,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:31:16,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:31:16,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:31:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:31:16,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:31:16,836 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:31:16,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689271659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:31:16,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:31:16,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-03-03 09:31:16,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656078046] [2025-03-03 09:31:16,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:31:16,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 09:31:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:31:16,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 09:31:16,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:31:16,837 INFO L87 Difference]: Start difference. First operand 216 states and 287 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:31:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:31:17,158 INFO L93 Difference]: Finished difference Result 249 states and 320 transitions. [2025-03-03 09:31:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:31:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2025-03-03 09:31:17,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:31:17,159 INFO L225 Difference]: With dead ends: 249 [2025-03-03 09:31:17,159 INFO L226 Difference]: Without dead ends: 246 [2025-03-03 09:31:17,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:31:17,160 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:31:17,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 285 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:31:17,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-03 09:31:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 207. [2025-03-03 09:31:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 172 states have (on average 1.308139534883721) internal successors, (225), 173 states have internal predecessors, (225), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 09:31:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 275 transitions. [2025-03-03 09:31:17,196 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 275 transitions. Word has length 32 [2025-03-03 09:31:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:31:17,196 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 275 transitions. [2025-03-03 09:31:17,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:31:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 275 transitions. [2025-03-03 09:31:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:31:17,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:31:17,197 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:31:17,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:31:17,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:31:17,398 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:31:17,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:31:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1623554032, now seen corresponding path program 10 times [2025-03-03 09:31:17,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:31:17,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834879804] [2025-03-03 09:31:17,398 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:31:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:31:17,404 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-03 09:31:17,417 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:31:17,417 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:31:17,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:31:17,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [607844124] [2025-03-03 09:31:17,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:31:17,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:31:17,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:31:17,420 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:31:17,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:31:17,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-03-03 09:31:17,553 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:31:17,553 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:31:17,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:31:17,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 84 conjuncts are in the unsatisfiable core [2025-03-03 09:31:17,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:31:17,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:31:17,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:31:17,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:31:17,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:31:17,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:17,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:31:17,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:31:17,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:31:17,702 INFO L349 Elim1Store]: treesize reduction 48, result has 31.4 percent of original size [2025-03-03 09:31:17,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 40 [2025-03-03 09:31:17,725 INFO L349 Elim1Store]: treesize reduction 48, result has 31.4 percent of original size [2025-03-03 09:31:17,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 40 [2025-03-03 09:31:17,818 INFO L349 Elim1Store]: treesize reduction 90, result has 25.6 percent of original size [2025-03-03 09:31:17,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 52 [2025-03-03 09:31:17,853 INFO L349 Elim1Store]: treesize reduction 90, result has 25.6 percent of original size [2025-03-03 09:31:17,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 52 [2025-03-03 09:31:18,318 INFO L349 Elim1Store]: treesize reduction 136, result has 32.0 percent of original size [2025-03-03 09:31:18,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 90 [2025-03-03 09:31:18,375 INFO L349 Elim1Store]: treesize reduction 126, result has 33.7 percent of original size [2025-03-03 09:31:18,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 55 treesize of output 88 [2025-03-03 09:31:21,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:21,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:21,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:21,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:22,723 INFO L349 Elim1Store]: treesize reduction 77, result has 85.4 percent of original size [2025-03-03 09:31:22,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 14 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 525 treesize of output 828 [2025-03-03 09:31:22,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:22,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:22,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:22,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:31:24,007 INFO L349 Elim1Store]: treesize reduction 73, result has 86.1 percent of original size [2025-03-03 09:31:24,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 14 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 667 treesize of output 814 [2025-03-03 09:31:44,475 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:44,849 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:44,938 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:45,066 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:45,842 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:45,954 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:46,676 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:31:46,973 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:48,803 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:49,936 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:51,134 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:51,230 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:31:51,559 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:51,921 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:52,351 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:52,443 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:52,619 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:52,690 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:52,768 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:53,148 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:53,533 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:53,815 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:53,959 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:54,162 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:54,242 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:54,407 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:54,781 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:54,909 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:55,042 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:55,385 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:56,543 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:31:56,851 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:58,010 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:58,373 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:58,477 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:31:58,797 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:31:58,920 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:59,006 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:59,410 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:59,596 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:31:59,657 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:31:59,741 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:00,023 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:00,087 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:00,246 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:00,390 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:00,866 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:01,701 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:03,569 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:03,664 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:32:03,997 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:04,791 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:05,156 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:05,233 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:05,403 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:05,530 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:06,139 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:32:06,439 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:07,991 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:09,167 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:09,534 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:09,637 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:32:09,957 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:10,087 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:10,171 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:10,545 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:10,733 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:10,848 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:11,195 WARN L672 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2025-03-03 09:32:12,365 WARN L672 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2025-03-03 09:32:17,214 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:19,390 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:20,416 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:21,163 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:21,916 WARN L672 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-03-03 09:32:22,398 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2025-03-03 09:32:22,497 WARN L672 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts.