./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i -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 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 14:00:40,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 14:00:40,534 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 14:00:40,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 14:00:40,541 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 14:00:40,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 14:00:40,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 14:00:40,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 14:00:40,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 14:00:40,563 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 14:00:40,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 14:00:40,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 14:00:40,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 14:00:40,567 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 14:00:40,567 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 14:00:40,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 14:00:40,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 14:00:40,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 14:00:40,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 14:00:40,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 14:00:40,569 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 14:00:40,569 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 14:00:40,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 14:00:40,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 14:00:40,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 14:00:40,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 14:00:40,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 14:00:40,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 14:00:40,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 14:00:40,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 14:00:40,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 14:00:40,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 14:00:40,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:00:40,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 14:00:40,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 14:00:40,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 14:00:40,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 14:00:40,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 14:00:40,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 14:00:40,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 14:00:40,572 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 14:00:40,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 14:00:40,574 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 68e1c5cf050539b3ee8f058d38ff7af5aea2a400d05e41e0185e4509f45301e0 [2024-11-08 14:00:40,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 14:00:40,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 14:00:40,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 14:00:40,792 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 14:00:40,792 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 14:00:40,793 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2024-11-08 14:00:41,959 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 14:00:42,143 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 14:00:42,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i [2024-11-08 14:00:42,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec7bfe88/3e977e7b48c340f6a4cf5699b3400d80/FLAG845dc779c [2024-11-08 14:00:42,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec7bfe88/3e977e7b48c340f6a4cf5699b3400d80 [2024-11-08 14:00:42,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 14:00:42,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 14:00:42,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 14:00:42,168 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 14:00:42,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 14:00:42,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f58a45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42, skipping insertion in model container [2024-11-08 14:00:42,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,218 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 14:00:42,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2024-11-08 14:00:42,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:00:42,485 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 14:00:42,533 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_of_sll_nondet_append-2.i[25013,25026] [2024-11-08 14:00:42,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 14:00:42,597 INFO L204 MainTranslator]: Completed translation [2024-11-08 14:00:42,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42 WrapperNode [2024-11-08 14:00:42,598 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 14:00:42,599 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 14:00:42,599 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 14:00:42,599 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 14:00:42,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,641 INFO L138 Inliner]: procedures = 129, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 184 [2024-11-08 14:00:42,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 14:00:42,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 14:00:42,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 14:00:42,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 14:00:42,653 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,682 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 6 writes are split as follows [0, 1, 5]. [2024-11-08 14:00:42,686 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,705 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 14:00:42,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 14:00:42,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 14:00:42,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 14:00:42,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (1/1) ... [2024-11-08 14:00:42,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 14:00:42,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:42,738 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) [2024-11-08 14:00:42,741 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 [2024-11-08 14:00:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 14:00:42,780 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 14:00:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 14:00:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 14:00:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 14:00:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 14:00:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 14:00:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 14:00:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2024-11-08 14:00:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2024-11-08 14:00:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 14:00:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 14:00:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 14:00:42,891 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 14:00:42,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 14:00:42,916 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 14:00:43,109 INFO L? ?]: Removed 57 outVars from TransFormulas that were not future-live. [2024-11-08 14:00:43,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 14:00:43,119 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 14:00:43,119 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-08 14:00:43,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:00:43 BoogieIcfgContainer [2024-11-08 14:00:43,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 14:00:43,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 14:00:43,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 14:00:43,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 14:00:43,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 02:00:42" (1/3) ... [2024-11-08 14:00:43,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34690ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:00:43, skipping insertion in model container [2024-11-08 14:00:43,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 02:00:42" (2/3) ... [2024-11-08 14:00:43,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34690ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 02:00:43, skipping insertion in model container [2024-11-08 14:00:43,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 02:00:43" (3/3) ... [2024-11-08 14:00:43,125 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2024-11-08 14:00:43,137 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 14:00:43,137 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 14:00:43,179 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 14:00:43,188 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c8e468f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 14:00:43,188 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 14:00:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 46 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:00:43,197 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:43,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:43,198 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:43,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:43,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1793365782, now seen corresponding path program 1 times [2024-11-08 14:00:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:43,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729250549] [2024-11-08 14:00:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:43,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:43,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729250549] [2024-11-08 14:00:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729250549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 14:00:43,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666626978] [2024-11-08 14:00:43,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:43,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 14:00:43,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:43,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 14:00:43,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:00:43,501 INFO L87 Difference]: Start difference. First operand has 51 states, 44 states have (on average 1.6136363636363635) internal successors, (71), 46 states have internal predecessors, (71), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:43,592 INFO L93 Difference]: Finished difference Result 100 states and 154 transitions. [2024-11-08 14:00:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 14:00:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-08 14:00:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:43,601 INFO L225 Difference]: With dead ends: 100 [2024-11-08 14:00:43,601 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 14:00:43,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 14:00:43,607 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:43,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:00:43,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 14:00:43,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 14:00:43,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 35 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:43,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-08 14:00:43,639 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 18 [2024-11-08 14:00:43,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:43,639 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-08 14:00:43,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:43,639 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-08 14:00:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 14:00:43,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:43,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:43,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 14:00:43,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:43,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:43,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1881945610, now seen corresponding path program 1 times [2024-11-08 14:00:43,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:43,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383832189] [2024-11-08 14:00:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 14:00:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383832189] [2024-11-08 14:00:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383832189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:43,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:43,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 14:00:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097492767] [2024-11-08 14:00:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:43,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:00:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:00:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:00:43,783 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:43,840 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2024-11-08 14:00:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:00:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-08 14:00:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:43,841 INFO L225 Difference]: With dead ends: 76 [2024-11-08 14:00:43,842 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 14:00:43,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:00:43,844 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 7 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:43,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 116 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:43,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 14:00:43,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2024-11-08 14:00:43,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2024-11-08 14:00:43,852 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 18 [2024-11-08 14:00:43,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2024-11-08 14:00:43,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2024-11-08 14:00:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-08 14:00:43,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:43,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 14:00:43,855 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:43,855 INFO L85 PathProgramCache]: Analyzing trace with hash -161196650, now seen corresponding path program 1 times [2024-11-08 14:00:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918032003] [2024-11-08 14:00:43,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:00:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:43,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:43,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:43,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918032003] [2024-11-08 14:00:43,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918032003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:43,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:43,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 14:00:43,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997827768] [2024-11-08 14:00:43,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:43,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 14:00:43,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:43,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 14:00:43,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 14:00:43,981 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:44,073 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2024-11-08 14:00:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 14:00:44,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2024-11-08 14:00:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:44,075 INFO L225 Difference]: With dead ends: 59 [2024-11-08 14:00:44,075 INFO L226 Difference]: Without dead ends: 57 [2024-11-08 14:00:44,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 14:00:44,078 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 25 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:44,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 124 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:00:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-08 14:00:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 42. [2024-11-08 14:00:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:44,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2024-11-08 14:00:44,087 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 23 [2024-11-08 14:00:44,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:44,088 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2024-11-08 14:00:44,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2024-11-08 14:00:44,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 14:00:44,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:44,090 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-08 14:00:44,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 14:00:44,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:44,091 INFO L85 PathProgramCache]: Analyzing trace with hash -632624117, now seen corresponding path program 1 times [2024-11-08 14:00:44,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:44,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840115952] [2024-11-08 14:00:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:44,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:00:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 14:00:44,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:44,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840115952] [2024-11-08 14:00:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840115952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:44,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:44,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 14:00:44,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282342723] [2024-11-08 14:00:44,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:44,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 14:00:44,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:44,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 14:00:44,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:00:44,189 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:44,224 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2024-11-08 14:00:44,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 14:00:44,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-08 14:00:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:44,225 INFO L225 Difference]: With dead ends: 58 [2024-11-08 14:00:44,225 INFO L226 Difference]: Without dead ends: 45 [2024-11-08 14:00:44,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 14:00:44,226 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:44,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-08 14:00:44,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-08 14:00:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-08 14:00:44,231 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 27 [2024-11-08 14:00:44,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:44,232 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-08 14:00:44,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-08 14:00:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 14:00:44,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:44,234 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-08 14:00:44,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 14:00:44,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:44,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:44,235 INFO L85 PathProgramCache]: Analyzing trace with hash -170012453, now seen corresponding path program 1 times [2024-11-08 14:00:44,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:44,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328389244] [2024-11-08 14:00:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:44,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-08 14:00:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:44,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:44,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328389244] [2024-11-08 14:00:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328389244] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:44,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16143514] [2024-11-08 14:00:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:44,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:44,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:44,343 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) [2024-11-08 14:00:44,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 14:00:44,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:44,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 14:00:44,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:44,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 14:00:44,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16143514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:44,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:44,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2024-11-08 14:00:44,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715134897] [2024-11-08 14:00:44,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:44,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 14:00:44,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:44,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 14:00:44,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:00:44,558 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 14:00:44,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:44,634 INFO L93 Difference]: Finished difference Result 94 states and 123 transitions. [2024-11-08 14:00:44,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:00:44,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-08 14:00:44,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:44,636 INFO L225 Difference]: With dead ends: 94 [2024-11-08 14:00:44,636 INFO L226 Difference]: Without dead ends: 61 [2024-11-08 14:00:44,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 14:00:44,637 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 35 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:44,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 179 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:00:44,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-08 14:00:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2024-11-08 14:00:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-08 14:00:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-08 14:00:44,642 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 30 [2024-11-08 14:00:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:44,643 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-08 14:00:44,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 14:00:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-08 14:00:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 14:00:44,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:44,644 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-08 14:00:44,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 14:00:44,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:44,849 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:44,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash 276326491, now seen corresponding path program 2 times [2024-11-08 14:00:44,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:44,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781002188] [2024-11-08 14:00:44,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:44,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:44,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:00:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:45,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:45,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781002188] [2024-11-08 14:00:45,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781002188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:45,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:45,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 14:00:45,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479190150] [2024-11-08 14:00:45,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:45,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 14:00:45,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:45,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 14:00:45,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:00:45,027 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:45,076 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2024-11-08 14:00:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 14:00:45,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2024-11-08 14:00:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:45,079 INFO L225 Difference]: With dead ends: 88 [2024-11-08 14:00:45,079 INFO L226 Difference]: Without dead ends: 70 [2024-11-08 14:00:45,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 14:00:45,080 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:45,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 232 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 14:00:45,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-08 14:00:45,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-08 14:00:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 62 states have internal predecessors, (80), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 14:00:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 91 transitions. [2024-11-08 14:00:45,088 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 91 transitions. Word has length 40 [2024-11-08 14:00:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:45,088 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 91 transitions. [2024-11-08 14:00:45,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 91 transitions. [2024-11-08 14:00:45,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-08 14:00:45,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:45,089 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2024-11-08 14:00:45,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 14:00:45,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:45,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -998257721, now seen corresponding path program 1 times [2024-11-08 14:00:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:45,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379557936] [2024-11-08 14:00:45,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:45,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:00:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379557936] [2024-11-08 14:00:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379557936] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:45,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205605573] [2024-11-08 14:00:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:45,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:45,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:45,261 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) [2024-11-08 14:00:45,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 14:00:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:45,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 14:00:45,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:45,409 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:45,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:45,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205605573] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:45,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:45,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2024-11-08 14:00:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133593903] [2024-11-08 14:00:45,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:45,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 14:00:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 14:00:45,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:00:45,559 INFO L87 Difference]: Start difference. First operand 68 states and 91 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:45,619 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2024-11-08 14:00:45,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 14:00:45,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2024-11-08 14:00:45,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:45,620 INFO L225 Difference]: With dead ends: 100 [2024-11-08 14:00:45,620 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 14:00:45,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-08 14:00:45,621 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:45,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 365 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:00:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 14:00:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 71. [2024-11-08 14:00:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.3125) internal successors, (84), 65 states have internal predecessors, (84), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 14:00:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2024-11-08 14:00:45,627 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 43 [2024-11-08 14:00:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:45,628 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2024-11-08 14:00:45,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 13 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-08 14:00:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2024-11-08 14:00:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 14:00:45,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:45,629 INFO L215 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, 1, 1, 1, 1] [2024-11-08 14:00:45,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 14:00:45,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 14:00:45,834 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:45,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash -330653477, now seen corresponding path program 2 times [2024-11-08 14:00:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773578235] [2024-11-08 14:00:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:00:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:46,048 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:46,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:46,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773578235] [2024-11-08 14:00:46,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773578235] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:46,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472585226] [2024-11-08 14:00:46,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:46,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:46,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:46,053 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) [2024-11-08 14:00:46,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 14:00:46,169 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:00:46,170 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:46,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 14:00:46,173 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:46,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:46,415 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:46,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472585226] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:46,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:46,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2024-11-08 14:00:46,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605501209] [2024-11-08 14:00:46,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:46,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 14:00:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 14:00:46,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:00:46,417 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:46,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:46,478 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2024-11-08 14:00:46,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 14:00:46,478 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2024-11-08 14:00:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:46,479 INFO L225 Difference]: With dead ends: 103 [2024-11-08 14:00:46,479 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 14:00:46,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-08 14:00:46,480 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 16 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:46,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 355 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 14:00:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 14:00:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2024-11-08 14:00:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-08 14:00:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2024-11-08 14:00:46,487 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 46 [2024-11-08 14:00:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:46,487 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2024-11-08 14:00:46,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 14 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2024-11-08 14:00:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-08 14:00:46,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:46,488 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2024-11-08 14:00:46,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 14:00:46,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:46,693 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:46,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:46,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1726168249, now seen corresponding path program 3 times [2024-11-08 14:00:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800600068] [2024-11-08 14:00:46,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:47,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:00:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:47,564 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 14:00:47,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:47,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800600068] [2024-11-08 14:00:47,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800600068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 14:00:47,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 14:00:47,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 14:00:47,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947307526] [2024-11-08 14:00:47,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 14:00:47,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 14:00:47,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:47,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 14:00:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-08 14:00:47,567 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:47,862 INFO L93 Difference]: Finished difference Result 166 states and 235 transitions. [2024-11-08 14:00:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 14:00:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2024-11-08 14:00:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:47,863 INFO L225 Difference]: With dead ends: 166 [2024-11-08 14:00:47,863 INFO L226 Difference]: Without dead ends: 149 [2024-11-08 14:00:47,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-08 14:00:47,864 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:47,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 607 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 14:00:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-08 14:00:47,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 91. [2024-11-08 14:00:47,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 84 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-08 14:00:47,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2024-11-08 14:00:47,874 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 49 [2024-11-08 14:00:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2024-11-08 14:00:47,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 14:00:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2024-11-08 14:00:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 14:00:47,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:47,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-11-08 14:00:47,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 14:00:47,876 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:47,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:47,877 INFO L85 PathProgramCache]: Analyzing trace with hash 421927055, now seen corresponding path program 1 times [2024-11-08 14:00:47,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:47,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010948753] [2024-11-08 14:00:47,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:47,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:00:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:49,200 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 14:00:49,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010948753] [2024-11-08 14:00:49,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010948753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:49,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413547258] [2024-11-08 14:00:49,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:49,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:49,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:49,203 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) [2024-11-08 14:00:49,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 14:00:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:49,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 78 conjuncts are in the unsatisfiable core [2024-11-08 14:00:49,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:49,358 INFO L378 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 [2024-11-08 14:00:49,417 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 14:00:49,418 INFO L378 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 [2024-11-08 14:00:49,457 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 14:00:49,458 INFO L378 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 [2024-11-08 14:00:49,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 14:00:49,565 INFO L378 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 [2024-11-08 14:00:49,625 INFO L378 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 [2024-11-08 14:00:49,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2024-11-08 14:00:49,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-08 14:00:49,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 14:00:49,792 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 14:00:49,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 43 treesize of output 36 [2024-11-08 14:00:49,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:49,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 14:00:49,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 49 [2024-11-08 14:00:50,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 14:00:50,076 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 14:00:50,076 INFO L378 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 43 treesize of output 22 [2024-11-08 14:00:50,079 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 14:00:50,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:50,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 106 [2024-11-08 14:00:50,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2024-11-08 14:00:50,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:50,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:50,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 458 [2024-11-08 14:00:51,242 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 14:00:51,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:00:51,260 INFO L378 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 631 treesize of output 572 [2024-11-08 14:00:52,521 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-08 14:00:52,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413547258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 14:00:52,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 14:00:52,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 41 [2024-11-08 14:00:52,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740248365] [2024-11-08 14:00:52,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 14:00:52,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 14:00:52,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 14:00:52,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 14:00:52,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1511, Unknown=0, NotChecked=0, Total=1640 [2024-11-08 14:00:52,524 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 37 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 14:00:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 14:00:53,589 INFO L93 Difference]: Finished difference Result 182 states and 256 transitions. [2024-11-08 14:00:53,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 14:00:53,590 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 37 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2024-11-08 14:00:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 14:00:53,593 INFO L225 Difference]: With dead ends: 182 [2024-11-08 14:00:53,593 INFO L226 Difference]: Without dead ends: 151 [2024-11-08 14:00:53,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=245, Invalid=2407, Unknown=0, NotChecked=0, Total=2652 [2024-11-08 14:00:53,594 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 137 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 14:00:53,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1257 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1069 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 14:00:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-08 14:00:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 92. [2024-11-08 14:00:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 85 states have internal predecessors, (110), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-08 14:00:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2024-11-08 14:00:53,611 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 50 [2024-11-08 14:00:53,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 14:00:53,611 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2024-11-08 14:00:53,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 37 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-08 14:00:53,612 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2024-11-08 14:00:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-08 14:00:53,614 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 14:00:53,615 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-11-08 14:00:53,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 14:00:53,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:53,816 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 14:00:53,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 14:00:53,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1706595257, now seen corresponding path program 2 times [2024-11-08 14:00:53,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 14:00:53,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971883515] [2024-11-08 14:00:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 14:00:53,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 14:00:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:54,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 14:00:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 14:00:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 14:00:55,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971883515] [2024-11-08 14:00:55,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971883515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 14:00:55,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507137417] [2024-11-08 14:00:55,449 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 14:00:55,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 14:00:55,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 14:00:55,451 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 14:00:55,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 14:00:55,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 14:00:55,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 14:00:55,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-08 14:00:55,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 14:00:55,592 INFO L378 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 [2024-11-08 14:00:55,619 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 14:00:55,619 INFO L378 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 [2024-11-08 14:00:55,704 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 14:00:55,704 INFO L378 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 17 treesize of output 21 [2024-11-08 14:00:55,769 INFO L378 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 [2024-11-08 14:00:55,823 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 14:00:55,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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 [2024-11-08 14:00:55,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:55,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2024-11-08 14:00:56,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2024-11-08 14:00:56,045 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-08 14:00:56,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 49 [2024-11-08 14:00:56,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 14:00:56,125 INFO L349 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2024-11-08 14:00:56,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 86 treesize of output 61 [2024-11-08 14:00:56,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 14:00:56,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 14:00:56,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 92 [2024-11-08 14:00:56,490 INFO L378 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-08 14:00:56,559 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2024-11-08 14:00:56,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 33 [2024-11-08 14:00:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 14:00:56,565 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 14:00:57,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 194 [2024-11-08 14:00:57,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:57,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 14:00:57,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2024-11-08 14:01:17,287 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_sll_append_node_create_with_sublist_~new_node~0#1.offset| 4))) (let ((.cse2 (= |c_sll_append_~head#1.offset| |c_sll_append_#in~head#1.offset|)) (.cse3 (= |c_sll_append_~head#1.base| |c_sll_append_#in~head#1.base|)) (.cse1 (store |c_#memory_$Pointer$#2.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.offset| |c_sll_append_node_create_with_sublist_~new_node~0#1.base|) .cse7 |c_sll_append_sll_create_#res#1.offset|) |c_sll_append_node_create_with_sublist_~new_node~0#1.offset| 0))) (.cse0 (store |c_#memory_$Pointer$#2.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base| (store (store (select |c_#memory_$Pointer$#2.base| |c_sll_append_node_create_with_sublist_~new_node~0#1.base|) .cse7 |c_sll_append_sll_create_#res#1.base|) |c_sll_append_node_create_with_sublist_~new_node~0#1.offset| 0)))) (and (or (not (= (select (select .cse0 (select (select .cse0 |c_sll_append_sll_create_#res#1.base|) |c_sll_append_sll_create_#res#1.offset|)) (select (select .cse1 |c_sll_append_sll_create_#res#1.base|) |c_sll_append_sll_create_#res#1.offset|)) 0)) (not .cse2) (not .cse3)) (or (and .cse2 .cse3) (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_49 Int)) (not (= (let ((.cse6 (+ 4 v_arrayElimCell_50))) (let ((.cse4 (select (select .cse0 v_arrayElimCell_49) .cse6)) (.cse5 (select (select .cse1 v_arrayElimCell_49) .cse6))) (select (select .cse0 (select (select .cse0 .cse4) .cse5)) (select (select .cse1 .cse4) .cse5)))) 0))))))) is different from false [2024-11-08 14:01:46,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 14:01:46,677 INFO L378 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 90571 treesize of output 87168