./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.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-simple/dll2n_append_unequal.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 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:57:49,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:57:49,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:57:49,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:57:49,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:57:49,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:57:49,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:57:49,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:57:49,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:57:49,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:57:49,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:57:49,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:57:49,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:57:49,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:57:49,554 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:57:49,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:57:49,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:57:49,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:57:49,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:57:49,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:57:49,557 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:57:49,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:57:49,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:57:49,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:57:49,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:57:49,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:57:49,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:57:49,561 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:57:49,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:57:49,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:57:49,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:57:49,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:57:49,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:57:49,563 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:57:49,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:57:49,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:57:49,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:57:49,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:57:49,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:57:49,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:57:49,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:57:49,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:57:49,565 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2024-11-08 13:57:49,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:57:49,881 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:57:49,884 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:57:49,885 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:57:49,886 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:57:49,887 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-08 13:57:51,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:57:51,567 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:57:51,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2024-11-08 13:57:51,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b5c79c7/19810166fed84405b7bfe4944787d0d1/FLAGb08c2999e [2024-11-08 13:57:51,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b5c79c7/19810166fed84405b7bfe4944787d0d1 [2024-11-08 13:57:51,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:57:51,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:57:51,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:57:51,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:57:51,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:57:51,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:57:51" (1/1) ... [2024-11-08 13:57:51,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17fdf44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:51, skipping insertion in model container [2024-11-08 13:57:51,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:57:51" (1/1) ... [2024-11-08 13:57:51,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:57:51,977 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-simple/dll2n_append_unequal.i[24457,24470] [2024-11-08 13:57:51,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:57:51,989 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:57:52,034 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-simple/dll2n_append_unequal.i[24457,24470] [2024-11-08 13:57:52,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:57:52,068 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:57:52,068 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52 WrapperNode [2024-11-08 13:57:52,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:57:52,069 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:57:52,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:57:52,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:57:52,076 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,113 INFO L138 Inliner]: procedures = 127, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2024-11-08 13:57:52,113 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:57:52,114 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:57:52,114 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:57:52,114 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:57:52,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,130 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,149 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 6, 16]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 1, 8]. [2024-11-08 13:57:52,149 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,150 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,173 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:57:52,174 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:57:52,175 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:57:52,175 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:57:52,176 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (1/1) ... [2024-11-08 13:57:52,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:57:52,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:52,222 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 13:57:52,225 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 13:57:52,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:57:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:57:52,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 13:57:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 13:57:52,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 13:57:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 13:57:52,281 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2024-11-08 13:57:52,281 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:57:52,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 13:57:52,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:57:52,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:57:52,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:57:52,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:57:52,742 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-08 13:57:52,743 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:57:52,807 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:57:52,808 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-08 13:57:52,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:57:52 BoogieIcfgContainer [2024-11-08 13:57:52,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:57:52,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:57:52,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:57:52,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:57:52,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:57:51" (1/3) ... [2024-11-08 13:57:52,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb8b77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:57:52, skipping insertion in model container [2024-11-08 13:57:52,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:57:52" (2/3) ... [2024-11-08 13:57:52,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cb8b77e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:57:52, skipping insertion in model container [2024-11-08 13:57:52,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:57:52" (3/3) ... [2024-11-08 13:57:52,822 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2024-11-08 13:57:52,837 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:57:52,837 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:57:52,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:57:52,897 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;@6e79cdda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:57:52,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:57:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 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 13:57:52,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:57:52,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:52,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:52,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:52,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:52,913 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2024-11-08 13:57:52,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:52,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594431406] [2024-11-08 13:57:52,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:52,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:53,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:57:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:53,214 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 13:57:53,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594431406] [2024-11-08 13:57:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594431406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:57:53,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200308880] [2024-11-08 13:57:53,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:53,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:57:53,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:53,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:57:53,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:57:53,258 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 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) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 13:57:53,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:53,339 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2024-11-08 13:57:53,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:57:53,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 17 [2024-11-08 13:57:53,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:53,355 INFO L225 Difference]: With dead ends: 65 [2024-11-08 13:57:53,356 INFO L226 Difference]: Without dead ends: 30 [2024-11-08 13:57:53,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 13:57:53,365 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:53,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:57:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-08 13:57:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-08 13:57:53,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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 13:57:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-08 13:57:53,403 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-08 13:57:53,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:53,404 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-08 13:57:53,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 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 13:57:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-08 13:57:53,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:57:53,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:53,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:53,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:57:53,407 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:53,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:53,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2024-11-08 13:57:53,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:53,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614779964] [2024-11-08 13:57:53,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:53,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:53,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 13:57:53,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:53,672 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 13:57:53,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:53,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614779964] [2024-11-08 13:57:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614779964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:53,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:53,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:57:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453091247] [2024-11-08 13:57:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:53,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:57:53,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:53,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:57:53,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:57:53,678 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 13:57:53,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:53,747 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2024-11-08 13:57:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:57:53,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2024-11-08 13:57:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:53,748 INFO L225 Difference]: With dead ends: 58 [2024-11-08 13:57:53,748 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 13:57:53,749 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 13:57:53,750 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:53,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 87 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:57:53,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 13:57:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-11-08 13:57:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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 13:57:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-11-08 13:57:53,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2024-11-08 13:57:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:53,764 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-11-08 13:57:53,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 13:57:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-11-08 13:57:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:57:53,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:53,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:53,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:57:53,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:53,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:53,768 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2024-11-08 13:57:53,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:53,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447367495] [2024-11-08 13:57:53,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:53,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:57:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:53,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 13:57:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:57:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:54,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447367495] [2024-11-08 13:57:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447367495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:57:54,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:57:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:57:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974281653] [2024-11-08 13:57:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:57:54,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:57:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:54,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:57:54,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:57:54,023 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 13:57:54,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:54,097 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2024-11-08 13:57:54,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:57:54,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-08 13:57:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:54,103 INFO L225 Difference]: With dead ends: 62 [2024-11-08 13:57:54,103 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 13:57:54,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 13:57:54,109 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:54,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:57:54,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 13:57:54,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-08 13:57:54,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:57:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2024-11-08 13:57:54,118 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2024-11-08 13:57:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:54,120 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2024-11-08 13:57:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 13:57:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2024-11-08 13:57:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 13:57:54,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:54,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:54,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:57:54,124 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:54,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2024-11-08 13:57:54,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:54,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297251899] [2024-11-08 13:57:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:57:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-08 13:57:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:57:54,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:54,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297251899] [2024-11-08 13:57:54,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297251899] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:54,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162138275] [2024-11-08 13:57:54,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:54,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:54,384 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 13:57:54,386 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 13:57:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:54,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 13:57:54,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:57:54,629 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:54,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-08 13:57:54,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162138275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:57:54,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:57:54,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2024-11-08 13:57:54,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85810124] [2024-11-08 13:57:54,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:54,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:57:54,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:54,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:57:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:57:54,698 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 13:57:54,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:57:54,763 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2024-11-08 13:57:54,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:57:54,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2024-11-08 13:57:54,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:57:54,765 INFO L225 Difference]: With dead ends: 59 [2024-11-08 13:57:54,765 INFO L226 Difference]: Without dead ends: 36 [2024-11-08 13:57:54,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:57:54,766 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:57:54,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 89 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:57:54,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-08 13:57:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-08 13:57:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:57:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-11-08 13:57:54,776 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2024-11-08 13:57:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:57:54,776 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-11-08 13:57:54,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-08 13:57:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-11-08 13:57:54,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:57:54,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:57:54,778 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:57:54,796 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 13:57:54,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:54,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:57:54,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:57:54,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2024-11-08 13:57:54,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:57:54,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162216065] [2024-11-08 13:57:54,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:54,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:57:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:57:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:57:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:55,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:57:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:55,427 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 13:57:55,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:57:55,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162216065] [2024-11-08 13:57:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162216065] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:57:55,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541022295] [2024-11-08 13:57:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:57:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:57:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:57:55,435 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 13:57:55,439 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 13:57:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:57:55,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-08 13:57:55,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:57:55,791 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 16 treesize of output 8 [2024-11-08 13:57:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:57:55,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:57:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-08 13:57:55,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541022295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:57:55,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:57:55,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 14 [2024-11-08 13:57:55,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464609260] [2024-11-08 13:57:55,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:57:55,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 13:57:55,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:57:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 13:57:55,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-08 13:57:55,886 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:57:59,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:58:03,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:58:07,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:58:12,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:58:16,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 13:58:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:16,185 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2024-11-08 13:58:16,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 13:58:16,185 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2024-11-08 13:58:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:16,186 INFO L225 Difference]: With dead ends: 69 [2024-11-08 13:58:16,187 INFO L226 Difference]: Without dead ends: 41 [2024-11-08 13:58:16,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2024-11-08 13:58:16,188 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:16,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 303 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 20.2s Time] [2024-11-08 13:58:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-08 13:58:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-08 13:58:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-08 13:58:16,199 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 37 [2024-11-08 13:58:16,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:16,200 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-08 13:58:16,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 12 states have internal predecessors, (35), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-08 13:58:16,200 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-08 13:58:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 13:58:16,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:16,201 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:16,220 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 13:58:16,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:16,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:16,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:16,403 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2024-11-08 13:58:16,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:16,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046746451] [2024-11-08 13:58:16,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:16,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:58:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:58:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:58:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046746451] [2024-11-08 13:58:17,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046746451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:17,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695988815] [2024-11-08 13:58:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:17,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:17,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:17,794 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 13:58:17,795 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 13:58:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:17,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-08 13:58:17,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:18,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:18,198 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:18,198 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 13:58:18,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 13:58:18,329 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 13:58:18,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-08 13:58:18,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2024-11-08 13:58:18,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2024-11-08 13:58:18,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:18,772 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 50 treesize of output 33 [2024-11-08 13:58:18,791 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-08 13:58:18,791 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 28 treesize of output 30 [2024-11-08 13:58:19,236 INFO L349 Elim1Store]: treesize reduction 65, result has 14.5 percent of original size [2024-11-08 13:58:19,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 52 [2024-11-08 13:58:19,260 INFO L349 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2024-11-08 13:58:19,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 91 [2024-11-08 13:58:19,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2024-11-08 13:58:19,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-08 13:58:19,341 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 24 treesize of output 12 [2024-11-08 13:58:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:19,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:20,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695988815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:20,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:58:20,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 40 [2024-11-08 13:58:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280405184] [2024-11-08 13:58:20,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:20,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-08 13:58:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:20,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 13:58:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2012, Unknown=2, NotChecked=0, Total=2162 [2024-11-08 13:58:20,118 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:58:21,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:21,443 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2024-11-08 13:58:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 13:58:21,443 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 40 [2024-11-08 13:58:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:21,444 INFO L225 Difference]: With dead ends: 57 [2024-11-08 13:58:21,444 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 13:58:21,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=301, Invalid=3729, Unknown=2, NotChecked=0, Total=4032 [2024-11-08 13:58:21,447 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 20 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:21,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 543 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 13:58:21,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 13:58:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2024-11-08 13:58:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2024-11-08 13:58:21,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 40 [2024-11-08 13:58:21,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:21,454 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2024-11-08 13:58:21,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-08 13:58:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2024-11-08 13:58:21,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:58:21,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:21,458 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:21,479 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 13:58:21,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:21,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:21,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1563025532, now seen corresponding path program 1 times [2024-11-08 13:58:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:21,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797877152] [2024-11-08 13:58:21,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:21,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:23,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:58:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:23,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:58:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:58:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:23,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797877152] [2024-11-08 13:58:23,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797877152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:23,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734032473] [2024-11-08 13:58:23,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:23,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:23,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:23,717 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 13:58:23,718 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 13:58:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:23,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-08 13:58:23,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:23,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:24,224 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:24,225 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 13:58:24,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-08 13:58:24,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-08 13:58:24,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2024-11-08 13:58:24,587 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 60 treesize of output 18 [2024-11-08 13:58:24,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2024-11-08 13:58:24,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:24,719 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 68 treesize of output 51 [2024-11-08 13:58:24,733 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-08 13:58:24,734 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 34 treesize of output 36 [2024-11-08 13:58:25,035 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2024-11-08 13:58:25,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 54 [2024-11-08 13:58:25,055 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-08 13:58:25,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 93 [2024-11-08 13:58:25,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2024-11-08 13:58:25,112 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 58 treesize of output 42 [2024-11-08 13:58:25,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-11-08 13:58:25,118 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 30 treesize of output 12 [2024-11-08 13:58:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:25,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:25,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734032473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:25,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:58:25,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 49 [2024-11-08 13:58:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416892325] [2024-11-08 13:58:25,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:25,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-08 13:58:25,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:25,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-08 13:58:25,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2801, Unknown=2, NotChecked=0, Total=2970 [2024-11-08 13:58:25,641 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 40 states have internal predecessors, (66), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:58:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:27,375 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-11-08 13:58:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-08 13:58:27,376 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 40 states have internal predecessors, (66), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 42 [2024-11-08 13:58:27,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:27,376 INFO L225 Difference]: With dead ends: 52 [2024-11-08 13:58:27,376 INFO L226 Difference]: Without dead ends: 49 [2024-11-08 13:58:27,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=420, Invalid=5430, Unknown=2, NotChecked=0, Total=5852 [2024-11-08 13:58:27,378 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:27,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 542 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 13:58:27,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-08 13:58:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2024-11-08 13:58:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2024-11-08 13:58:27,387 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 42 [2024-11-08 13:58:27,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:27,388 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2024-11-08 13:58:27,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.4042553191489362) internal successors, (66), 40 states have internal predecessors, (66), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-08 13:58:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2024-11-08 13:58:27,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 13:58:27,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:27,389 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:27,404 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 13:58:27,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:27,590 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:27,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:27,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2024-11-08 13:58:27,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:27,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676231940] [2024-11-08 13:58:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:27,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:28,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:58:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:58:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:29,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:58:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676231940] [2024-11-08 13:58:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676231940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572695776] [2024-11-08 13:58:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:29,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:29,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:29,282 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 13:58:29,283 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 13:58:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:29,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-08 13:58:29,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:29,905 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 13:58:30,299 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:30,300 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 17 treesize of output 21 [2024-11-08 13:58:30,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 13:58:30,392 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 13:58:30,444 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 16 treesize of output 11 [2024-11-08 13:58:30,452 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 16 treesize of output 11 [2024-11-08 13:58:30,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:58:30,853 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:58:30,858 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 11 treesize of output 3 [2024-11-08 13:58:31,124 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-08 13:58:31,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2024-11-08 13:58:31,145 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-08 13:58:31,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-08 13:58:31,156 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 20 treesize of output 15 [2024-11-08 13:58:31,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:58:31,548 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-08 13:58:31,553 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 20 treesize of output 15 [2024-11-08 13:58:31,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-08 13:58:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:58:31,743 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:43,178 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1242 Int) (|v_ULTIMATE.start_dll_append_~last~0#1.base_23| Int) (v_ArrVal_1240 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |v_ULTIMATE.start_dll_append_~last~0#1.base_23| (store (select |c_#memory_int#2| |v_ULTIMATE.start_dll_append_~last~0#1.base_23|) (+ (select (select |c_#memory_$Pointer$#2.offset| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) 4)) 4) v_ArrVal_1242)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1240) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2024-11-08 13:58:43,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572695776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:43,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:58:43,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2024-11-08 13:58:43,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794419238] [2024-11-08 13:58:43,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:43,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-08 13:58:43,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-08 13:58:43,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2752, Unknown=54, NotChecked=106, Total=3080 [2024-11-08 13:58:43,320 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:58:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:45,429 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2024-11-08 13:58:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 13:58:45,429 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 44 [2024-11-08 13:58:45,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:45,430 INFO L225 Difference]: With dead ends: 65 [2024-11-08 13:58:45,431 INFO L226 Difference]: Without dead ends: 63 [2024-11-08 13:58:45,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=336, Invalid=5016, Unknown=54, NotChecked=144, Total=5550 [2024-11-08 13:58:45,433 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 57 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:45,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 521 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1148 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 13:58:45,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-08 13:58:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2024-11-08 13:58:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-11-08 13:58:45,442 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 44 [2024-11-08 13:58:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:45,442 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-11-08 13:58:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 42 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:58:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-11-08 13:58:45,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 13:58:45,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:45,444 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:45,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:45,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:45,647 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:45,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:45,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1173262244, now seen corresponding path program 1 times [2024-11-08 13:58:45,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:45,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711596682] [2024-11-08 13:58:45,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:45,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:58:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:58:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:58:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 13:58:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711596682] [2024-11-08 13:58:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711596682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:58:45,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:58:45,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:58:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645173244] [2024-11-08 13:58:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:58:45,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:58:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:58:45,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:58:45,801 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:58:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:45,882 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2024-11-08 13:58:45,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:58:45,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2024-11-08 13:58:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:45,884 INFO L225 Difference]: With dead ends: 61 [2024-11-08 13:58:45,884 INFO L226 Difference]: Without dead ends: 56 [2024-11-08 13:58:45,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:58:45,885 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:45,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:58:45,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-08 13:58:45,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-08 13:58:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 13:58:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2024-11-08 13:58:45,896 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 45 [2024-11-08 13:58:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:45,896 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2024-11-08 13:58:45,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 13:58:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2024-11-08 13:58:45,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-08 13:58:45,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:45,901 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:45,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 13:58:45,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash -731397669, now seen corresponding path program 2 times [2024-11-08 13:58:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:45,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608034582] [2024-11-08 13:58:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:58:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:58:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:58:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:48,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608034582] [2024-11-08 13:58:48,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608034582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:48,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664406929] [2024-11-08 13:58:48,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:58:48,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:48,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:48,729 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:48,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 13:58:48,960 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:58:48,960 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:58:48,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 121 conjuncts are in the unsatisfiable core [2024-11-08 13:58:48,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:49,026 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 13:58:49,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 13:58:49,145 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 13:58:49,438 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:49,439 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 17 treesize of output 21 [2024-11-08 13:58:49,448 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 16 treesize of output 11 [2024-11-08 13:58:49,456 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 16 treesize of output 11 [2024-11-08 13:58:49,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-08 13:58:49,542 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 16 treesize of output 11 [2024-11-08 13:58:49,552 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-08 13:58:49,556 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 16 treesize of output 11 [2024-11-08 13:58:49,647 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-08 13:58:49,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 57 [2024-11-08 13:58:49,661 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 46 treesize of output 42 [2024-11-08 13:58:50,110 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-08 13:58:50,111 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 134 treesize of output 45 [2024-11-08 13:58:50,117 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 36 treesize of output 14 [2024-11-08 13:58:50,121 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-08 13:58:50,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:58:50,284 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-08 13:58:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 142 treesize of output 103 [2024-11-08 13:58:50,320 INFO L349 Elim1Store]: treesize reduction 60, result has 47.8 percent of original size [2024-11-08 13:58:50,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 80 [2024-11-08 13:58:50,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:58:50,339 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 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-08 13:58:50,360 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-08 13:58:50,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2024-11-08 13:58:50,538 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 139 treesize of output 107 [2024-11-08 13:58:50,776 INFO L349 Elim1Store]: treesize reduction 54, result has 5.3 percent of original size [2024-11-08 13:58:50,777 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 45 [2024-11-08 13:58:50,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:58:50,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:58:51,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664406929] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:51,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 13:58:51,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24] total 50 [2024-11-08 13:58:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81330608] [2024-11-08 13:58:51,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 13:58:51,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-08 13:58:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:58:51,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-08 13:58:51,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2824, Unknown=0, NotChecked=0, Total=2970 [2024-11-08 13:58:51,371 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 42 states have internal predecessors, (77), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:58:54,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:58:54,079 INFO L93 Difference]: Finished difference Result 101 states and 119 transitions. [2024-11-08 13:58:54,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-08 13:58:54,080 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 42 states have internal predecessors, (77), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2024-11-08 13:58:54,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:58:54,081 INFO L225 Difference]: With dead ends: 101 [2024-11-08 13:58:54,081 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 13:58:54,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=361, Invalid=6611, Unknown=0, NotChecked=0, Total=6972 [2024-11-08 13:58:54,083 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 13:58:54,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 497 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 13:58:54,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 13:58:54,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2024-11-08 13:58:54,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-08 13:58:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2024-11-08 13:58:54,096 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 46 [2024-11-08 13:58:54,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:58:54,096 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2024-11-08 13:58:54,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 42 states have internal predecessors, (77), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-08 13:58:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2024-11-08 13:58:54,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 13:58:54,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:58:54,097 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:58:54,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 13:58:54,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:54,298 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:58:54,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:58:54,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2018358036, now seen corresponding path program 1 times [2024-11-08 13:58:54,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:58:54,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858480023] [2024-11-08 13:58:54,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:58:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:56,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 13:58:56,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:56,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:58:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:58:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 13:58:56,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:58:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858480023] [2024-11-08 13:58:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858480023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:58:56,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337149226] [2024-11-08 13:58:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:58:56,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:58:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:58:56,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:58:56,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 13:58:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:58:57,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 157 conjuncts are in the unsatisfiable core [2024-11-08 13:58:57,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:58:57,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 13:58:57,218 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 13:58:57,333 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 13:58:57,339 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 26 treesize of output 11 [2024-11-08 13:58:57,345 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 13:58:57,690 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:58:57,691 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-08 13:58:57,710 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 13:58:57,712 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 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-08 13:58:57,736 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 13:58:57,736 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 13:58:57,749 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 16 treesize of output 11 [2024-11-08 13:58:57,824 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-08 13:58:57,829 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 16 treesize of output 11 [2024-11-08 13:58:57,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2024-11-08 13:58:57,850 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 16 treesize of output 11 [2024-11-08 13:58:57,863 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 16 treesize of output 11 [2024-11-08 13:58:57,975 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2024-11-08 13:58:57,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 150 treesize of output 83 [2024-11-08 13:58:57,985 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 47 treesize of output 17 [2024-11-08 13:58:57,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-08 13:58:58,383 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-08 13:58:58,383 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 173 treesize of output 56 [2024-11-08 13:58:58,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2024-11-08 13:58:58,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 15 treesize of output 7 [2024-11-08 13:58:58,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2024-11-08 13:58:58,535 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2024-11-08 13:58:58,535 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 34 treesize of output 36 [2024-11-08 13:59:02,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (+ .cse4 4))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse7) 0))) (or (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|)) (.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse1)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse0 .cse1)) (= (select .cse2 4) 0) (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= .cse4 (select .cse2 8)) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= (select .cse5 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6) (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse1) 0) 1) (= (select .cse5 8) .cse0) (not (= .cse1 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse6 (select |c_#memory_$Pointer$#2.base| .cse6)) |c_#memory_$Pointer$#2.base|))))) .cse8) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= .cse9 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse12 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse13 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse12)) (.cse14 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse12)) (.cse11 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select .cse10 4) 0) (= .cse4 (select .cse10 8)) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse11 (select |c_#memory_$Pointer$#2.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse0) .cse7) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse11)))) (not (= .cse0 .cse12)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)) (= (select .cse13 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14) (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse12) 0) 1) (= (select .cse13 8) .cse0) (not (= .cse12 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse14 (select |c_#memory_$Pointer$#2.base| .cse14)) |c_#memory_$Pointer$#2.base|))))) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse9 (select |c_#memory_int#2| .cse9)) |c_#memory_int#2|)))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse7))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse17 (select |c_#memory_$Pointer$#2.offset| .cse16))) (and (= (select .cse15 8) .cse0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse16)) (= (select (select |c_#memory_int#2| .cse16) 0) 1) (not (= .cse0 .cse16)) (= (select .cse15 4) 0) (not (= .cse16 0)) (= (select .cse17 8) .cse4) (= (select .cse17 4) 0) .cse8))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse18 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse21 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse18)) (.cse22 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |c_#memory_int#2| .cse18) 0) 1) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse18)) (.cse20 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select .cse19 4) 0) (= .cse4 (select .cse19 8)) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse20 (select |c_#memory_$Pointer$#2.offset| .cse20))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse0) .cse7) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse20)))) (not (= .cse0 .cse18)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse18)) (= (select .cse21 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse22) (= (select .cse21 8) .cse0) (not (= .cse18 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse22 (select |c_#memory_$Pointer$#2.base| .cse22)) |c_#memory_$Pointer$#2.base|))))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse23 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse24 (select |c_#memory_$Pointer$#2.offset| .cse23)) (.cse25 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse23)) (.cse26 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |c_#memory_int#2| .cse23) 0) 1) (not (= .cse0 .cse23)) (= (select .cse24 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse23)) (= .cse4 (select .cse24 8)) (= (select .cse25 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse26) (= (select .cse25 8) .cse0) (not (= .cse23 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse26 (select |c_#memory_$Pointer$#2.base| .cse26)) |c_#memory_$Pointer$#2.base|))))) .cse8))))))) is different from false [2024-11-08 13:59:02,964 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~data~0#1| 1) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse0)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse7 (+ .cse4 4))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse7) 0))) (or (and (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| .cse1)) (.cse3 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|)) (.cse5 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse1)) (.cse6 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (not (= .cse0 .cse1)) (= (select .cse2 4) 0) (= .cse3 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse1)) (= .cse4 (select .cse2 8)) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse3 (select |c_#memory_int#2| .cse3)) |c_#memory_int#2|) (= (select .cse5 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse6) (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse1) 0) 1) (= (select .cse5 8) .cse0) (not (= .cse1 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse6 (select |c_#memory_$Pointer$#2.base| .cse6)) |c_#memory_$Pointer$#2.base|))))) .cse8) (exists ((|v_#memory_int#2_BEFORE_CALL_6| (Array Int (Array Int Int)))) (let ((.cse9 (@diff |v_#memory_int#2_BEFORE_CALL_6| |c_#memory_int#2|))) (and (= .cse9 |c_ULTIMATE.start_dll_append_#t~ret7#1.base|) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse12 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse13 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse12)) (.cse14 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse12)) (.cse11 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select .cse10 4) 0) (= .cse4 (select .cse10 8)) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse11 (select |c_#memory_$Pointer$#2.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse0) .cse7) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse11)))) (not (= .cse0 .cse12)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse12)) (= (select .cse13 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse14) (= (select (select |v_#memory_int#2_BEFORE_CALL_6| .cse12) 0) 1) (= (select .cse13 8) .cse0) (not (= .cse12 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse14 (select |c_#memory_$Pointer$#2.base| .cse14)) |c_#memory_$Pointer$#2.base|))))) (= (store |v_#memory_int#2_BEFORE_CALL_6| .cse9 (select |c_#memory_int#2| .cse9)) |c_#memory_int#2|)))) (let ((.cse16 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse7))) (let ((.cse15 (select |c_#memory_$Pointer$#2.base| .cse16)) (.cse17 (select |c_#memory_$Pointer$#2.offset| .cse16))) (and (= (select .cse15 8) .cse0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse16)) (= (select (select |c_#memory_int#2| .cse16) 0) 1) (not (= .cse0 .cse16)) (= (select .cse15 4) 0) (not (= .cse16 0)) (= (select .cse17 8) .cse4) (= (select .cse17 4) 0) .cse8))) (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse18 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse21 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse18)) (.cse22 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |c_#memory_int#2| .cse18) 0) 1) (exists ((|v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse18)) (.cse20 (@diff |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| |c_#memory_$Pointer$#2.offset|))) (and (= (select .cse19 4) 0) (= .cse4 (select .cse19 8)) (= |c_#memory_$Pointer$#2.offset| (store |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse20 (select |c_#memory_$Pointer$#2.offset| .cse20))) (= (select (select |v_old(#memory_$Pointer$#2.offset)_AFTER_CALL_20| .cse0) .cse7) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse20)))) (not (= .cse0 .cse18)) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse18)) (= (select .cse21 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse22) (= (select .cse21 8) .cse0) (not (= .cse18 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse22 (select |c_#memory_$Pointer$#2.base| .cse22)) |c_#memory_$Pointer$#2.base|))))) (and (exists ((|v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| (Array Int (Array Int Int)))) (let ((.cse23 (select (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse0) .cse7))) (let ((.cse24 (select |c_#memory_$Pointer$#2.offset| .cse23)) (.cse25 (select |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse23)) (.cse26 (@diff |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| |c_#memory_$Pointer$#2.base|))) (and (= (select (select |c_#memory_int#2| .cse23) 0) 1) (not (= .cse0 .cse23)) (= (select .cse24 4) 0) (not (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse23)) (= .cse4 (select .cse24 8)) (= (select .cse25 4) 0) (= |c_ULTIMATE.start_dll_append_#t~ret7#1.base| .cse26) (= (select .cse25 8) .cse0) (not (= .cse23 0)) (= (store |v_old(#memory_$Pointer$#2.base)_AFTER_CALL_20| .cse26 (select |c_#memory_$Pointer$#2.base| .cse26)) |c_#memory_$Pointer$#2.base|))))) .cse8))))))) is different from true [2024-11-08 13:59:03,662 INFO L349 Elim1Store]: treesize reduction 47, result has 16.1 percent of original size [2024-11-08 13:59:03,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 98 [2024-11-08 13:59:03,690 INFO L349 Elim1Store]: treesize reduction 37, result has 11.9 percent of original size [2024-11-08 13:59:03,691 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 193 treesize of output 140 [2024-11-08 13:59:03,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2024-11-08 13:59:03,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-08 13:59:03,878 INFO L349 Elim1Store]: treesize reduction 208, result has 41.7 percent of original size [2024-11-08 13:59:03,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 157 treesize of output 227 [2024-11-08 13:59:03,985 INFO L349 Elim1Store]: treesize reduction 164, result has 25.5 percent of original size [2024-11-08 13:59:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 271 treesize of output 162 [2024-11-08 13:59:04,036 INFO L349 Elim1Store]: treesize reduction 100, result has 15.3 percent of original size [2024-11-08 13:59:04,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 283 [2024-11-08 13:59:04,089 INFO L349 Elim1Store]: treesize reduction 79, result has 21.0 percent of original size [2024-11-08 13:59:04,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 38 [2024-11-08 13:59:04,125 INFO L349 Elim1Store]: treesize reduction 83, result has 24.5 percent of original size [2024-11-08 13:59:04,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 122 [2024-11-08 13:59:04,147 INFO L349 Elim1Store]: treesize reduction 45, result has 35.7 percent of original size [2024-11-08 13:59:04,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 29 [2024-11-08 13:59:04,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-08 13:59:04,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 618 treesize of output 486 [2024-11-08 13:59:04,522 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 490 treesize of output 358 [2024-11-08 13:59:06,358 INFO L349 Elim1Store]: treesize reduction 48, result has 93.0 percent of original size [2024-11-08 13:59:06,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 3 disjoint index pairs (out of 91 index pairs), introduced 18 new quantified variables, introduced 91 case distinctions, treesize of input 460 treesize of output 850 [2024-11-08 13:59:07,006 INFO L349 Elim1Store]: treesize reduction 24, result has 95.0 percent of original size [2024-11-08 13:59:07,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 53 case distinctions, treesize of input 202 treesize of output 606