./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.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 aba3f42f796e2ee163a5b91800a7e5c10b615df582a38d64a93abe0a4e3d9d42 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:53:40,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:53:40,713 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:53:40,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:53:40,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:53:40,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:53:40,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:53:40,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:53:40,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:53:40,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:53:40,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:53:40,747 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:53:40,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:53:40,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:53:40,748 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:53:40,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:53:40,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:53:40,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:53:40,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:53:40,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:53:40,748 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:53:40,749 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:53:40,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:40,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:40,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:53:40,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:53:40,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:53:40,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:53:40,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:53:40,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:53:40,751 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 -> aba3f42f796e2ee163a5b91800a7e5c10b615df582a38d64a93abe0a4e3d9d42 [2025-04-29 10:53:41,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:53:41,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:53:41,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:53:41,024 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:53:41,025 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:53:41,026 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.c [2025-04-29 10:53:42,365 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ea84eef/e8627a55a7bf4672989121d7897a6226/FLAGa38245190 [2025-04-29 10:53:42,592 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:53:42,593 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.c [2025-04-29 10:53:42,595 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:53:42,595 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:53:42,601 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ea84eef/e8627a55a7bf4672989121d7897a6226/FLAGa38245190 [2025-04-29 10:53:43,366 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ea84eef/e8627a55a7bf4672989121d7897a6226 [2025-04-29 10:53:43,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:53:43,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:53:43,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:53:43,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:53:43,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:53:43,374 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72776276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43, skipping insertion in model container [2025-04-29 10:53:43,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,391 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:53:43,545 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.c[2365,2378] [2025-04-29 10:53:43,550 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:53:43,556 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:53:43,589 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.c[2365,2378] [2025-04-29 10:53:43,592 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:53:43,616 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:53:43,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43 WrapperNode [2025-04-29 10:53:43,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:53:43,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:53:43,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:53:43,618 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:53:43,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,650 INFO L138 Inliner]: procedures = 18, calls = 35, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 156 [2025-04-29 10:53:43,653 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:53:43,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:53:43,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:53:43,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:53:43,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,668 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,695 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [5, 13]. 72 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 6 writes are split as follows [1, 5]. [2025-04-29 10:53:43,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,717 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:53:43,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:53:43,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:53:43,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:53:43,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (1/1) ... [2025-04-29 10:53:43,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:53:43,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:43,754 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-04-29 10:53:43,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-04-29 10:53:43,776 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:53:43,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:53:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 10:53:43,854 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:53:43,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:53:43,880 INFO L726 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-04-29 10:53:44,053 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2025-04-29 10:53:44,053 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:53:44,061 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:53:44,062 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 10:53:44,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:53:44 BoogieIcfgContainer [2025-04-29 10:53:44,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:53:44,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:53:44,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:53:44,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:53:44,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:53:43" (1/3) ... [2025-04-29 10:53:44,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec2e4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:53:44, skipping insertion in model container [2025-04-29 10:53:44,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:53:43" (2/3) ... [2025-04-29 10:53:44,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec2e4a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:53:44, skipping insertion in model container [2025-04-29 10:53:44,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:53:44" (3/3) ... [2025-04-29 10:53:44,069 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.c [2025-04-29 10:53:44,079 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:53:44,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_of_sll_nondet_append-1.c that has 2 procedures, 44 locations, 65 edges, 1 initial locations, 9 loop locations, and 1 error locations. [2025-04-29 10:53:44,119 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:53:44,126 INFO L340 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;@25899be7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:53:44,126 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:53:44,129 INFO L278 IsEmpty]: Start isEmpty. Operand has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 41 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:44,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 10:53:44,134 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:44,134 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 10:53:44,135 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:44,139 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:44,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1039642492, now seen corresponding path program 1 times [2025-04-29 10:53:44,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:44,145 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211046498] [2025-04-29 10:53:44,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:44,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:44,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 10:53:44,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 10:53:44,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:44,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:44,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:44,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211046498] [2025-04-29 10:53:44,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211046498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:44,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:44,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:53:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685521048] [2025-04-29 10:53:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:44,360 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:53:44,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:44,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:53:44,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:53:44,375 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 41 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:44,462 INFO L93 Difference]: Finished difference Result 108 states and 156 transitions. [2025-04-29 10:53:44,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:53:44,466 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-29 10:53:44,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:44,470 INFO L225 Difference]: With dead ends: 108 [2025-04-29 10:53:44,470 INFO L226 Difference]: Without dead ends: 52 [2025-04-29 10:53:44,474 INFO L436 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-04-29 10:53:44,476 INFO L437 NwaCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:44,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 150 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:53:44,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-04-29 10:53:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-04-29 10:53:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2025-04-29 10:53:44,510 INFO L79 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 6 [2025-04-29 10:53:44,511 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:44,511 INFO L485 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2025-04-29 10:53:44,512 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:44,512 INFO L278 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2025-04-29 10:53:44,512 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-29 10:53:44,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:44,513 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:44,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:53:44,513 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:44,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:44,514 INFO L85 PathProgramCache]: Analyzing trace with hash 858277911, now seen corresponding path program 1 times [2025-04-29 10:53:44,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:44,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520915655] [2025-04-29 10:53:44,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:44,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 10:53:44,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 10:53:44,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:44,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:53:44,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:44,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520915655] [2025-04-29 10:53:44,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520915655] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:44,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:44,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:53:44,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224273666] [2025-04-29 10:53:44,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:44,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:53:44,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:44,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:53:44,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:53:44,706 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:44,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:44,763 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2025-04-29 10:53:44,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:53:44,763 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-29 10:53:44,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:44,764 INFO L225 Difference]: With dead ends: 101 [2025-04-29 10:53:44,764 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 10:53:44,764 INFO L436 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-04-29 10:53:44,765 INFO L437 NwaCegarLoop]: 32 mSDtfsCounter, 53 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:44,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 70 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:53:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 10:53:44,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 54. [2025-04-29 10:53:44,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:44,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2025-04-29 10:53:44,772 INFO L79 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 22 [2025-04-29 10:53:44,772 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:44,772 INFO L485 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2025-04-29 10:53:44,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:44,772 INFO L278 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2025-04-29 10:53:44,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:53:44,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:44,773 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:44,773 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:53:44,773 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:44,773 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -2110337435, now seen corresponding path program 1 times [2025-04-29 10:53:44,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:44,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008990168] [2025-04-29 10:53:44,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:44,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:44,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 10:53:44,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 10:53:44,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:44,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:44,927 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008990168] [2025-04-29 10:53:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008990168] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 10:53:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367581680] [2025-04-29 10:53:44,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:44,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 10:53:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:44,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 10:53:44,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:53:44,929 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:45,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:45,007 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2025-04-29 10:53:45,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:53:45,008 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-29 10:53:45,008 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:45,009 INFO L225 Difference]: With dead ends: 122 [2025-04-29 10:53:45,009 INFO L226 Difference]: Without dead ends: 70 [2025-04-29 10:53:45,010 INFO L436 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-04-29 10:53:45,010 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:45,010 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 108 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:45,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-04-29 10:53:45,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2025-04-29 10:53:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2025-04-29 10:53:45,017 INFO L79 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2025-04-29 10:53:45,017 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:45,018 INFO L485 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2025-04-29 10:53:45,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:45,018 INFO L278 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2025-04-29 10:53:45,018 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 10:53:45,018 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:45,018 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:45,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:53:45,019 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:45,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1117772675, now seen corresponding path program 1 times [2025-04-29 10:53:45,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:45,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493422350] [2025-04-29 10:53:45,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:45,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:45,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:53:45,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:53:45,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:45,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:45,142 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 10:53:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:45,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493422350] [2025-04-29 10:53:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493422350] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:45,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315314465] [2025-04-29 10:53:45,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:45,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:45,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:45,145 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-04-29 10:53:45,147 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-04-29 10:53:45,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 10:53:45,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:53:45,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:45,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:45,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-29 10:53:45,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:45,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:45,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:45,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:53:45,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315314465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:45,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2025-04-29 10:53:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875463359] [2025-04-29 10:53:45,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:45,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 10:53:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:45,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 10:53:45,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:53:45,374 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:45,638 INFO L93 Difference]: Finished difference Result 236 states and 304 transitions. [2025-04-29 10:53:45,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 10:53:45,639 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 10:53:45,639 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:45,640 INFO L225 Difference]: With dead ends: 236 [2025-04-29 10:53:45,641 INFO L226 Difference]: Without dead ends: 182 [2025-04-29 10:53:45,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=437, Unknown=0, NotChecked=0, Total=600 [2025-04-29 10:53:45,643 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 132 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:45,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 197 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-04-29 10:53:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2025-04-29 10:53:45,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.2203389830508475) internal successors, (144), 118 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:45,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 144 transitions. [2025-04-29 10:53:45,662 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 144 transitions. Word has length 31 [2025-04-29 10:53:45,662 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:45,662 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 144 transitions. [2025-04-29 10:53:45,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:45,664 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 144 transitions. [2025-04-29 10:53:45,664 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-04-29 10:53:45,666 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:45,666 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:45,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:53:45,866 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:45,867 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:45,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash -62495947, now seen corresponding path program 2 times [2025-04-29 10:53:45,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:45,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011985923] [2025-04-29 10:53:45,867 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:53:45,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:45,882 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 10:53:45,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:53:45,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:53:45,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:46,073 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:53:46,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:46,074 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011985923] [2025-04-29 10:53:46,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011985923] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:46,075 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548289318] [2025-04-29 10:53:46,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:53:46,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:46,077 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-04-29 10:53:46,079 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-04-29 10:53:46,139 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 10:53:46,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 10:53:46,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:53:46,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:46,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 10:53:46,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:53:46,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:53:46,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548289318] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:53:46,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:53:46,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-29 10:53:46,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195517720] [2025-04-29 10:53:46,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:53:46,400 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 10:53:46,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:46,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 10:53:46,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:53:46,402 INFO L87 Difference]: Start difference. First operand 119 states and 144 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:46,510 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2025-04-29 10:53:46,510 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 10:53:46,510 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-04-29 10:53:46,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:46,512 INFO L225 Difference]: With dead ends: 240 [2025-04-29 10:53:46,513 INFO L226 Difference]: Without dead ends: 226 [2025-04-29 10:53:46,513 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-04-29 10:53:46,514 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 155 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:46,514 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 200 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-04-29 10:53:46,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 172. [2025-04-29 10:53:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.2105263157894737) internal successors, (207), 171 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2025-04-29 10:53:46,544 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 42 [2025-04-29 10:53:46,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:46,544 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2025-04-29 10:53:46,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 11 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:46,544 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2025-04-29 10:53:46,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-04-29 10:53:46,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:46,547 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:46,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 10:53:46,747 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:46,747 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:46,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:46,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1984458365, now seen corresponding path program 3 times [2025-04-29 10:53:46,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:46,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690530392] [2025-04-29 10:53:46,748 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:53:46,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:46,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 8 equivalence classes. [2025-04-29 10:53:46,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 41 of 47 statements. [2025-04-29 10:53:46,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-29 10:53:46,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:47,622 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 10:53:47,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:47,622 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690530392] [2025-04-29 10:53:47,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690530392] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:53:47,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:53:47,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-29 10:53:47,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114306853] [2025-04-29 10:53:47,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:53:47,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 10:53:47,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:53:47,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 10:53:47,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-29 10:53:47,623 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:53:47,830 INFO L93 Difference]: Finished difference Result 253 states and 308 transitions. [2025-04-29 10:53:47,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:53:47,831 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-04-29 10:53:47,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:53:47,832 INFO L225 Difference]: With dead ends: 253 [2025-04-29 10:53:47,832 INFO L226 Difference]: Without dead ends: 238 [2025-04-29 10:53:47,832 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-29 10:53:47,833 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 66 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:53:47,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 213 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:53:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-04-29 10:53:47,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 203. [2025-04-29 10:53:47,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 1.2376237623762376) internal successors, (250), 202 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:47,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 250 transitions. [2025-04-29 10:53:47,858 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 250 transitions. Word has length 47 [2025-04-29 10:53:47,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:53:47,858 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 250 transitions. [2025-04-29 10:53:47,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:53:47,860 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 250 transitions. [2025-04-29 10:53:47,861 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-04-29 10:53:47,862 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:53:47,862 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:53:47,863 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 10:53:47,863 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:53:47,863 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:53:47,863 INFO L85 PathProgramCache]: Analyzing trace with hash -448370460, now seen corresponding path program 1 times [2025-04-29 10:53:47,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:53:47,863 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186623687] [2025-04-29 10:53:47,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:47,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:53:47,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 10:53:47,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 10:53:47,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:47,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:48,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:53:48,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:53:48,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186623687] [2025-04-29 10:53:48,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186623687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:53:48,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826373535] [2025-04-29 10:53:48,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:53:48,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:53:48,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:53:48,768 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-04-29 10:53:48,770 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-04-29 10:53:48,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 10:53:48,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 10:53:48,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:53:48,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:53:48,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-04-29 10:53:48,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:53:48,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:53:49,013 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 10:53:49,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 10:53:49,071 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 10:53:49,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 10:53:49,181 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:53:49,181 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-04-29 10:53:49,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:53:49,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2025-04-29 10:53:49,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 20 [2025-04-29 10:53:49,498 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:53:49,498 INFO L354 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 37 [2025-04-29 10:53:49,515 INFO L354 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 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-29 10:53:49,581 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:53:49,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 10:53:49,598 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-29 10:53:49,598 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2025-04-29 10:53:50,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:50,223 INFO L354 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 141 treesize of output 101 [2025-04-29 10:53:50,245 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:50,246 INFO L354 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 97 treesize of output 97 [2025-04-29 10:53:50,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-04-29 10:53:50,534 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:53:50,534 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 22 [2025-04-29 10:53:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:53:50,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:53:51,066 INFO L354 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 1046 treesize of output 986 [2025-04-29 10:53:51,237 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 1046 treesize of output 986 [2025-04-29 10:53:55,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:53:55,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:53:55,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:53:55,974 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:53:56,065 INFO L325 Elim1Store]: treesize reduction 82, result has 48.8 percent of original size [2025-04-29 10:53:56,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 108621 treesize of output 101231 [2025-04-29 10:53:56,844 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:53:56,867 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:56,867 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3643 treesize of output 2754 [2025-04-29 10:53:57,832 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:53:57,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:57,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3643 treesize of output 2754 [2025-04-29 10:53:58,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:53:58,702 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:53:58,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:53:58,706 INFO L354 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 562 treesize of output 546 [2025-04-29 10:53:58,745 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:53:58,766 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:58,766 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 6400 treesize of output 4775 [2025-04-29 10:53:59,529 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:53:59,530 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:53:59,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:53:59,549 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3643 treesize of output 2754 [2025-04-29 10:54:00,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:00,304 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:00,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:00,306 INFO L354 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 562 treesize of output 546 [2025-04-29 10:54:00,342 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:00,445 INFO L325 Elim1Store]: treesize reduction 74, result has 62.4 percent of original size [2025-04-29 10:54:00,445 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 108621 treesize of output 101276 [2025-04-29 10:54:01,326 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:01,347 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:01,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 6400 treesize of output 4775 [2025-04-29 10:54:02,329 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:02,352 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:02,352 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 6400 treesize of output 4775 [2025-04-29 10:54:03,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,060 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:03,100 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:03,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 3643 treesize of output 2754 [2025-04-29 10:54:03,623 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:03,624 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:03,646 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:03,646 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 6400 treesize of output 4775 [2025-04-29 10:54:20,359 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:54:20,359 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 120 [2025-04-29 10:54:20,387 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:20,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 222 [2025-04-29 10:54:20,568 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:54:20,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 94 treesize of output 92 [2025-04-29 10:54:20,596 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:54:20,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 94 treesize of output 92 [2025-04-29 10:54:20,615 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:54:20,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 122 treesize of output 120 [2025-04-29 10:54:20,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:20,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 222 [2025-04-29 10:54:20,920 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-29 10:54:20,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [826373535] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:20,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:20,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 40 [2025-04-29 10:54:20,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532572144] [2025-04-29 10:54:20,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:20,920 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-29 10:54:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:20,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-29 10:54:20,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1434, Unknown=1, NotChecked=0, Total=1560 [2025-04-29 10:54:20,921 INFO L87 Difference]: Start difference. First operand 203 states and 250 transitions. Second operand has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:54:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:24,770 INFO L93 Difference]: Finished difference Result 335 states and 411 transitions. [2025-04-29 10:54:24,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-29 10:54:24,770 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-04-29 10:54:24,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:24,771 INFO L225 Difference]: With dead ends: 335 [2025-04-29 10:54:24,771 INFO L226 Difference]: Without dead ends: 307 [2025-04-29 10:54:24,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=406, Invalid=3883, Unknown=1, NotChecked=0, Total=4290 [2025-04-29 10:54:24,773 INFO L437 NwaCegarLoop]: 35 mSDtfsCounter, 311 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:24,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 809 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-29 10:54:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-04-29 10:54:24,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 204. [2025-04-29 10:54:24,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 1.2364532019704433) internal successors, (251), 203 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:54:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 251 transitions. [2025-04-29 10:54:24,787 INFO L79 Accepts]: Start accepts. Automaton has 204 states and 251 transitions. Word has length 48 [2025-04-29 10:54:24,787 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:24,787 INFO L485 AbstractCegarLoop]: Abstraction has 204 states and 251 transitions. [2025-04-29 10:54:24,788 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.45) internal successors, (98), 40 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 10:54:24,788 INFO L278 IsEmpty]: Start isEmpty. Operand 204 states and 251 transitions. [2025-04-29 10:54:24,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-04-29 10:54:24,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:24,789 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:24,798 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-04-29 10:54:24,989 WARN L466 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-04-29 10:54:24,989 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:24,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1443347293, now seen corresponding path program 2 times [2025-04-29 10:54:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:24,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118659417] [2025-04-29 10:54:24,990 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:54:24,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:25,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-29 10:54:25,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 10:54:25,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:54:25,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:26,159 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:54:26,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:26,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118659417] [2025-04-29 10:54:26,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118659417] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:26,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26417905] [2025-04-29 10:54:26,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:54:26,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:26,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:26,161 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-04-29 10:54:26,164 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-04-29 10:54:26,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-04-29 10:54:26,256 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 10:54:26,256 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:54:26,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:26,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-04-29 10:54:26,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:26,307 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:54:26,380 INFO L325 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-04-29 10:54:26,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-04-29 10:54:26,507 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:54:26,508 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:54:26,599 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:54:26,669 INFO L325 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-04-29 10:54:26,669 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-04-29 10:54:26,747 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:26,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2025-04-29 10:54:26,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2025-04-29 10:54:26,897 INFO L325 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-04-29 10:54:26,897 INFO L354 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 42 [2025-04-29 10:54:26,981 INFO L325 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2025-04-29 10:54:26,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 91 treesize of output 62 [2025-04-29 10:54:26,987 INFO L354 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 0 case distinctions, treesize of input 37 treesize of output 35 [2025-04-29 10:54:27,074 INFO L325 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-04-29 10:54:27,074 INFO L354 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 1 case distinctions, treesize of input 23 treesize of output 15 [2025-04-29 10:54:27,084 INFO L325 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-04-29 10:54:27,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-04-29 10:54:27,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:27,877 INFO L354 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 305 treesize of output 209 [2025-04-29 10:54:27,884 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:27,885 INFO L354 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 205 treesize of output 205 [2025-04-29 10:54:28,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-04-29 10:54:28,232 INFO L325 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2025-04-29 10:54:28,233 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 79 treesize of output 33 [2025-04-29 10:54:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-29 10:54:28,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:29,245 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:29,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 88831 treesize of output 84312 Killed by 15