./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:34:31,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:34:31,670 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:34:31,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:34:31,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:34:31,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:34:31,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:34:31,698 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:34:31,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:34:31,699 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:34:31,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:34:31,699 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:34:31,700 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:34:31,700 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:34:31,701 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:34:31,703 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:34:31,703 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:34:31,704 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:34:31,704 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:34:31,704 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:34:31,704 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:34:31,708 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:34:31,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:34:31,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:34:31,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:34:31,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:34:31,709 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:34:31,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:34:31,710 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:34:31,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:34:31,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:34:31,711 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:34:31,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:34:31,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:34:31,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:34:31,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:34:31,712 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:34:31,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:34:31,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:34:31,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:34:31,714 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:34:31,715 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:34:31,715 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-clean/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-clean/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 -> 2725e330d17b26eb9ce2dcee483f6c78572e140dfdc07b8b5f8c08e6f3c60756 [2024-10-11 01:34:31,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:34:31,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:34:31,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:34:31,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:34:31,992 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:34:31,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-10-11 01:34:33,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:34:33,693 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:34:33,693 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext2-properties/simple_and_skiplist_2lvl-2.i [2024-10-11 01:34:33,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38a2350d2/5d5ffc68f46e4116b5324438559cd417/FLAGb3015f6e6 [2024-10-11 01:34:33,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/38a2350d2/5d5ffc68f46e4116b5324438559cd417 [2024-10-11 01:34:33,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:34:33,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:34:33,727 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:34:33,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:34:33,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:34:33,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:33" (1/1) ... [2024-10-11 01:34:33,735 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c9e7c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:33, skipping insertion in model container [2024-10-11 01:34:33,735 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:33" (1/1) ... [2024-10-11 01:34:33,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:34:34,137 WARN L248 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-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-10-11 01:34:34,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:34:34,159 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:34:34,213 WARN L248 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-ext2-properties/simple_and_skiplist_2lvl-2.i[24020,24033] [2024-10-11 01:34:34,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:34:34,248 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:34:34,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34 WrapperNode [2024-10-11 01:34:34,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:34:34,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:34:34,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:34:34,251 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:34:34,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,277 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,308 INFO L138 Inliner]: procedures = 126, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 175 [2024-10-11 01:34:34,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:34:34,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:34:34,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:34:34,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:34:34,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,361 INFO L175 MemorySlicer]: Split 38 memory accesses to 4 slices as follows [2, 13, 16, 7]. 42 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 15 writes are split as follows [0, 3, 8, 4]. [2024-10-11 01:34:34,365 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:34:34,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:34:34,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:34:34,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:34:34,395 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (1/1) ... [2024-10-11 01:34:34,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:34:34,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:34,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:34:34,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:34:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 01:34:34,495 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 01:34:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 01:34:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 01:34:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 01:34:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 01:34:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 01:34:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 01:34:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 01:34:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 01:34:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:34:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:34:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:34:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:34:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 01:34:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 01:34:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:34:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:34:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 01:34:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 01:34:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:34:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:34:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:34:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 01:34:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 01:34:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:34:34,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:34:34,630 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:34:34,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:34:34,667 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 01:34:34,948 INFO L? ?]: Removed 42 outVars from TransFormulas that were not future-live. [2024-10-11 01:34:34,948 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:34:34,987 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:34:34,987 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 01:34:34,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:34 BoogieIcfgContainer [2024-10-11 01:34:34,988 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:34:34,992 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:34:34,992 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:34:34,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:34:34,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:34:33" (1/3) ... [2024-10-11 01:34:35,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fba4742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:34, skipping insertion in model container [2024-10-11 01:34:35,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:34" (2/3) ... [2024-10-11 01:34:35,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fba4742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:35, skipping insertion in model container [2024-10-11 01:34:35,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:34" (3/3) ... [2024-10-11 01:34:35,005 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl-2.i [2024-10-11 01:34:35,024 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:34:35,024 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:34:35,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:34:35,096 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;@19c343ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:34:35,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:34:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 33 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:35,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 01:34:35,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:35,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:35,111 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:35,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:35,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1520544426, now seen corresponding path program 1 times [2024-10-11 01:34:35,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:35,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957429169] [2024-10-11 01:34:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:35,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:35,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:35,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:35,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957429169] [2024-10-11 01:34:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957429169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:34:35,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543095244] [2024-10-11 01:34:35,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:34:35,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:35,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:34:35,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:34:35,346 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 33 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:35,385 INFO L93 Difference]: Finished difference Result 59 states and 89 transitions. [2024-10-11 01:34:35,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:34:35,387 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 01:34:35,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:35,392 INFO L225 Difference]: With dead ends: 59 [2024-10-11 01:34:35,392 INFO L226 Difference]: Without dead ends: 13 [2024-10-11 01:34:35,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:34:35,398 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:35,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:34:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-11 01:34:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-11 01:34:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-11 01:34:35,466 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 8 [2024-10-11 01:34:35,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:35,466 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-11 01:34:35,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-10-11 01:34:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:34:35,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:35,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:35,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:34:35,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:35,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash -334874522, now seen corresponding path program 1 times [2024-10-11 01:34:35,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:35,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063075573] [2024-10-11 01:34:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:35,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:35,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063075573] [2024-10-11 01:34:35,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063075573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:35,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:35,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:34:35,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131365457] [2024-10-11 01:34:35,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:35,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:34:35,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:34:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:34:35,795 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:35,870 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2024-10-11 01:34:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:34:35,871 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 01:34:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:35,871 INFO L225 Difference]: With dead ends: 23 [2024-10-11 01:34:35,871 INFO L226 Difference]: Without dead ends: 21 [2024-10-11 01:34:35,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:34:35,873 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:35,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:34:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-10-11 01:34:35,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-10-11 01:34:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2024-10-11 01:34:35,879 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2024-10-11 01:34:35,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:35,879 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2024-10-11 01:34:35,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2024-10-11 01:34:35,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 01:34:35,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:35,880 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:35,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:34:35,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:35,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash 966956042, now seen corresponding path program 1 times [2024-10-11 01:34:35,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580047540] [2024-10-11 01:34:35,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:35,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:35,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:36,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:36,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580047540] [2024-10-11 01:34:36,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580047540] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:36,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455984575] [2024-10-11 01:34:36,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:36,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:36,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:36,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:36,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:34:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:36,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 01:34:36,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:36,450 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-10-11 01:34:36,458 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-10-11 01:34:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:36,510 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:34:36,565 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 27 treesize of output 21 [2024-10-11 01:34:36,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:36,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:36,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455984575] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:34:36,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:34:36,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 01:34:36,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638829226] [2024-10-11 01:34:36,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:34:36,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 01:34:36,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:36,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 01:34:36,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:34:36,605 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:36,668 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-11 01:34:36,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:34:36,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 01:34:36,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:36,670 INFO L225 Difference]: With dead ends: 27 [2024-10-11 01:34:36,670 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 01:34:36,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:34:36,671 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:36,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 36 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:34:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 01:34:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2024-10-11 01:34:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-11 01:34:36,680 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2024-10-11 01:34:36,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:36,680 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-11 01:34:36,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2024-10-11 01:34:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:34:36,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:36,681 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:36,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:34:36,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:36,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:36,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -932787123, now seen corresponding path program 1 times [2024-10-11 01:34:36,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014151492] [2024-10-11 01:34:36,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014151492] [2024-10-11 01:34:37,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014151492] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64231060] [2024-10-11 01:34:37,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:37,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:37,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:37,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:37,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:34:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:37,305 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 01:34:37,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:37,327 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-10-11 01:34:37,400 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-10-11 01:34:37,420 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:34:37,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:34:37,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-11 01:34:37,492 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 15 treesize of output 1 [2024-10-11 01:34:37,497 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-10-11 01:34:37,540 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-10-11 01:34:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:37,569 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:34:37,648 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (or (not (= v_ArrVal_111 (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_111 .cse0))))) (= (select (select (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_111) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) is different from false [2024-10-11 01:34:37,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:37,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 134 [2024-10-11 01:34:37,719 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 24 treesize of output 20 [2024-10-11 01:34:37,755 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 5 treesize of output 3 [2024-10-11 01:34:37,764 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 102 treesize of output 98 [2024-10-11 01:34:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:37,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64231060] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:34:37,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:34:37,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-10-11 01:34:37,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035387298] [2024-10-11 01:34:37,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:34:37,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 01:34:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 01:34:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=190, Unknown=3, NotChecked=28, Total=272 [2024-10-11 01:34:37,875 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:38,049 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2024-10-11 01:34:38,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 01:34:38,050 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 01:34:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:38,051 INFO L225 Difference]: With dead ends: 27 [2024-10-11 01:34:38,051 INFO L226 Difference]: Without dead ends: 25 [2024-10-11 01:34:38,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=327, Unknown=3, NotChecked=38, Total=462 [2024-10-11 01:34:38,054 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:38,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 102 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2024-10-11 01:34:38,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-11 01:34:38,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2024-10-11 01:34:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-10-11 01:34:38,064 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2024-10-11 01:34:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:38,064 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-10-11 01:34:38,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 16 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-10-11 01:34:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 01:34:38,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:38,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:38,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 01:34:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:38,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:38,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash -217963837, now seen corresponding path program 1 times [2024-10-11 01:34:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:38,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744162983] [2024-10-11 01:34:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:38,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:38,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744162983] [2024-10-11 01:34:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744162983] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524532715] [2024-10-11 01:34:38,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:38,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:38,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:38,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:38,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:34:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:38,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 01:34:38,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:38,784 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-10-11 01:34:38,824 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:34:38,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:34:38,853 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-10-11 01:34:38,861 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 15 treesize of output 1 [2024-10-11 01:34:38,917 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 01:34:38,918 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 71 treesize of output 62 [2024-10-11 01:34:38,922 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 30 treesize of output 11 [2024-10-11 01:34:38,931 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 24 treesize of output 11 [2024-10-11 01:34:38,987 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 27 treesize of output 15 [2024-10-11 01:34:38,992 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 7 treesize of output 3 [2024-10-11 01:34:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:39,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:34:39,055 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 199 treesize of output 177 [2024-10-11 01:34:39,074 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (and (forall ((v_ArrVal_175 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.offset| (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_174 (Array Int Int))) (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_174) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2024-10-11 01:34:39,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:39,105 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-10-11 01:34:39,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:39,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-10-11 01:34:39,118 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 7 treesize of output 3 [2024-10-11 01:34:39,147 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-10-11 01:34:39,147 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-10-11 01:34:39,235 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 01:34:39,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524532715] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:34:39,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:34:39,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-11 01:34:39,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83980806] [2024-10-11 01:34:39,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:34:39,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 01:34:39,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 01:34:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=174, Unknown=1, NotChecked=26, Total=240 [2024-10-11 01:34:39,238 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:39,431 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2024-10-11 01:34:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 01:34:39,431 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 01:34:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:39,432 INFO L225 Difference]: With dead ends: 30 [2024-10-11 01:34:39,432 INFO L226 Difference]: Without dead ends: 28 [2024-10-11 01:34:39,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=309, Unknown=1, NotChecked=36, Total=420 [2024-10-11 01:34:39,433 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:39,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 54 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 105 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2024-10-11 01:34:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-10-11 01:34:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-10-11 01:34:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-11 01:34:39,438 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2024-10-11 01:34:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:39,438 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-11 01:34:39,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 15 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:39,439 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-10-11 01:34:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 01:34:39,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:39,439 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:39,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:34:39,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:39,644 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:39,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:39,645 INFO L85 PathProgramCache]: Analyzing trace with hash 989402292, now seen corresponding path program 2 times [2024-10-11 01:34:39,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:39,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390547725] [2024-10-11 01:34:39,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:39,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390547725] [2024-10-11 01:34:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390547725] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738491138] [2024-10-11 01:34:40,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:34:40,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:40,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:40,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:40,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:34:40,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:34:40,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:34:40,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-11 01:34:40,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:40,148 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-10-11 01:34:40,193 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 01:34:40,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-10-11 01:34:40,212 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-10-11 01:34:40,267 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 15 treesize of output 1 [2024-10-11 01:34:40,273 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-10-11 01:34:40,280 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 23 treesize of output 11 [2024-10-11 01:34:40,324 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:34:40,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:34:40,332 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-10-11 01:34:40,387 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-10-11 01:34:40,428 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 18 [2024-10-11 01:34:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:40,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:34:40,587 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (v_ArrVal_274 Int) (|v_ULTIMATE.start_main_~t~0#1.base_25| Int) (v_ArrVal_266 (Array Int Int))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_272))) (store .cse0 |v_ULTIMATE.start_main_~t~0#1.base_25| (store (store (select .cse0 |v_ULTIMATE.start_main_~t~0#1.base_25|) 0 1) 4 v_ArrVal_274))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_25|) 0)) (not (= v_ArrVal_266 (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 (select v_ArrVal_266 .cse1))))))) is different from false [2024-10-11 01:34:40,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:40,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1476 treesize of output 1470 [2024-10-11 01:34:40,665 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 798 treesize of output 766 [2024-10-11 01:34:44,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 523 treesize of output 511 [2024-10-11 01:34:44,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,591 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-10-11 01:34:44,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,622 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,637 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,652 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-10-11 01:34:44,706 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 250 treesize of output 240 [2024-10-11 01:34:44,741 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 152 treesize of output 146 [2024-10-11 01:34:44,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 48 treesize of output 46 [2024-10-11 01:34:44,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,802 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,818 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,830 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,831 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,842 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 67 treesize of output 61 [2024-10-11 01:34:44,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,880 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 14 treesize of output 12 [2024-10-11 01:34:44,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 23 treesize of output 21 [2024-10-11 01:34:44,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,915 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,923 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,924 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,933 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,934 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 18 [2024-10-11 01:34:44,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,946 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:44,991 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:44,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:45,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,018 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 14 treesize of output 12 [2024-10-11 01:34:45,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,034 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 7 [2024-10-11 01:34:45,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,057 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:45,060 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 61 treesize of output 57 [2024-10-11 01:34:45,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,075 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:45,078 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 146 treesize of output 142 [2024-10-11 01:34:45,089 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:45,092 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 146 treesize of output 142 [2024-10-11 01:34:45,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:45,113 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 1735 treesize of output 1717 [2024-10-11 01:34:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-11 01:34:45,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738491138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:34:45,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:34:45,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-10-11 01:34:45,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225264359] [2024-10-11 01:34:45,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:34:45,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 01:34:45,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:45,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 01:34:45,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=302, Unknown=1, NotChecked=36, Total=420 [2024-10-11 01:34:45,456 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:45,704 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2024-10-11 01:34:45,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 01:34:45,705 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 01:34:45,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:45,706 INFO L225 Difference]: With dead ends: 32 [2024-10-11 01:34:45,706 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 01:34:45,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=472, Unknown=1, NotChecked=46, Total=650 [2024-10-11 01:34:45,707 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:45,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 54 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2024-10-11 01:34:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 01:34:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-10-11 01:34:45,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-10-11 01:34:45,711 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2024-10-11 01:34:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:45,711 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-10-11 01:34:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-10-11 01:34:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 01:34:45,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:45,712 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:45,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 01:34:45,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 01:34:45,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:45,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 634695821, now seen corresponding path program 2 times [2024-10-11 01:34:45,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:45,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560207521] [2024-10-11 01:34:45,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:45,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560207521] [2024-10-11 01:34:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560207521] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30127776] [2024-10-11 01:34:46,301 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:34:46,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:46,305 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:46,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:34:46,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:34:46,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:34:46,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-11 01:34:46,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:46,400 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-10-11 01:34:46,432 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 01:34:46,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 01:34:46,458 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 15 treesize of output 1 [2024-10-11 01:34:46,466 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-10-11 01:34:46,515 INFO L349 Elim1Store]: treesize reduction 18, result has 21.7 percent of original size [2024-10-11 01:34:46,516 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 35 treesize of output 36 [2024-10-11 01:34:46,521 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 12 treesize of output 11 [2024-10-11 01:34:46,527 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 21 treesize of output 23 [2024-10-11 01:34:46,531 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 12 treesize of output 11 [2024-10-11 01:34:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:46,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:34:46,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:46,720 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 1 case distinctions, treesize of input 45 treesize of output 49 [2024-10-11 01:34:46,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:46,725 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 1 case distinctions, treesize of input 40 treesize of output 39 [2024-10-11 01:34:46,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:46,749 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 1 case distinctions, treesize of input 45 treesize of output 44 [2024-10-11 01:34:46,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:46,755 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 1 case distinctions, treesize of input 35 treesize of output 39 [2024-10-11 01:34:46,874 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:46,874 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2024-10-11 01:34:46,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:46,882 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-10-11 01:34:46,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:46,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2024-10-11 01:34:47,071 INFO L349 Elim1Store]: treesize reduction 42, result has 82.1 percent of original size [2024-10-11 01:34:47,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 208 treesize of output 335 [2024-10-11 01:34:47,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:47,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 117 [2024-10-11 01:34:47,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:47,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 152 treesize of output 176 [2024-10-11 01:34:55,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:55,304 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 61 [2024-10-11 01:34:55,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:55,313 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 41 [2024-10-11 01:34:55,361 INFO L349 Elim1Store]: treesize reduction 84, result has 25.0 percent of original size [2024-10-11 01:34:55,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 138 treesize of output 111 [2024-10-11 01:34:55,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:55,370 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 43 treesize of output 37 [2024-10-11 01:34:55,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:55,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:55,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 67 [2024-10-11 01:34:55,381 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 8 treesize of output 4 [2024-10-11 01:34:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30127776] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:34:55,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:34:55,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2024-10-11 01:34:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808844158] [2024-10-11 01:34:55,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:34:55,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 01:34:55,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 01:34:55,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=220, Unknown=8, NotChecked=0, Total=272 [2024-10-11 01:34:55,542 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:55,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:55,676 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-11 01:34:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 01:34:55,676 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 01:34:55,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:55,677 INFO L225 Difference]: With dead ends: 36 [2024-10-11 01:34:55,677 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 01:34:55,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=276, Unknown=8, NotChecked=0, Total=342 [2024-10-11 01:34:55,678 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:55,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 68 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:34:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 01:34:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-11 01:34:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:55,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2024-10-11 01:34:55,681 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2024-10-11 01:34:55,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:55,682 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2024-10-11 01:34:55,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 16 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:55,682 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2024-10-11 01:34:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 01:34:55,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:55,682 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:55,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 01:34:55,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:55,883 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:55,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:55,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1072059140, now seen corresponding path program 3 times [2024-10-11 01:34:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072760653] [2024-10-11 01:34:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:55,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:56,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:56,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072760653] [2024-10-11 01:34:56,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072760653] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:56,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54289097] [2024-10-11 01:34:56,472 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 01:34:56,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:56,474 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:56,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:34:56,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 01:34:56,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:34:56,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-10-11 01:34:56,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:56,610 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-10-11 01:34:56,639 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:34:56,639 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-10-11 01:34:56,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 01:34:56,687 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 15 treesize of output 1 [2024-10-11 01:34:56,730 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 01:34:56,731 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 33 treesize of output 24 [2024-10-11 01:34:56,744 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-11 01:34:56,744 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-10-11 01:34:56,756 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-10-11 01:34:56,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:56,763 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-10-11 01:34:56,814 INFO L349 Elim1Store]: treesize reduction 43, result has 14.0 percent of original size [2024-10-11 01:34:56,814 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 175 treesize of output 125 [2024-10-11 01:34:56,817 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 128 treesize of output 105 [2024-10-11 01:34:56,823 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 55 treesize of output 19 [2024-10-11 01:34:56,894 INFO L349 Elim1Store]: treesize reduction 56, result has 16.4 percent of original size [2024-10-11 01:34:56,895 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 135 [2024-10-11 01:34:56,905 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-10-11 01:34:56,905 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 128 treesize of output 121 [2024-10-11 01:34:56,908 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 52 treesize of output 19 [2024-10-11 01:34:56,950 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-10-11 01:34:56,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 30 [2024-10-11 01:34:56,956 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 19 treesize of output 11 [2024-10-11 01:34:56,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:56,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:34:56,985 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_439 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_438) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2024-10-11 01:34:57,000 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array Int Int)) (v_ArrVal_437 (Array Int Int)) (v_ArrVal_439 (Array Int Int)) (v_ArrVal_432 (Array Int Int)) (v_ArrVal_431 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (or (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (select (select (store (store |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_431) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_438) (select (select (store (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_432) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1) (not (= v_ArrVal_431 (store (select |c_#memory_int#3| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 (select v_ArrVal_431 .cse0))))))) is different from false [2024-10-11 01:34:57,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,016 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 1 case distinctions, treesize of input 42 treesize of output 46 [2024-10-11 01:34:57,025 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 540 treesize of output 526 [2024-10-11 01:34:57,036 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 108 treesize of output 72 [2024-10-11 01:34:57,073 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 21 treesize of output 3 [2024-10-11 01:34:57,077 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 358 treesize of output 322 [2024-10-11 01:34:57,090 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 379 treesize of output 325 [2024-10-11 01:34:57,120 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 30 treesize of output 22 [2024-10-11 01:34:57,126 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 33 treesize of output 25 [2024-10-11 01:34:57,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,226 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-11 01:34:57,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 65 [2024-10-11 01:34:57,239 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 54 treesize of output 46 [2024-10-11 01:34:57,244 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 24 treesize of output 20 [2024-10-11 01:34:57,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,306 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2024-10-11 01:34:57,308 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:57,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 38 [2024-10-11 01:34:57,326 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 26 treesize of output 22 [2024-10-11 01:34:57,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,344 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2024-10-11 01:34:57,346 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:57,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2024-10-11 01:34:57,362 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2024-10-11 01:34:57,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,394 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2024-10-11 01:34:57,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 01:34:57,405 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2024-10-11 01:34:57,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:34:57,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2024-10-11 01:34:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-11 01:34:57,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54289097] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:34:57,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:34:57,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-10-11 01:34:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036169189] [2024-10-11 01:34:57,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:34:57,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 01:34:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 01:34:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=352, Unknown=3, NotChecked=78, Total=506 [2024-10-11 01:34:57,872 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:58,220 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-10-11 01:34:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 01:34:58,220 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 01:34:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:58,221 INFO L225 Difference]: With dead ends: 36 [2024-10-11 01:34:58,221 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 01:34:58,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=637, Unknown=3, NotChecked=106, Total=870 [2024-10-11 01:34:58,222 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:58,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 95 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 194 Invalid, 0 Unknown, 57 Unchecked, 0.2s Time] [2024-10-11 01:34:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 01:34:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2024-10-11 01:34:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-10-11 01:34:58,226 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2024-10-11 01:34:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:58,227 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-10-11 01:34:58,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 01:34:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-10-11 01:34:58,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 01:34:58,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:58,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:58,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 01:34:58,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 01:34:58,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:58,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:58,429 INFO L85 PathProgramCache]: Analyzing trace with hash -332214348, now seen corresponding path program 4 times [2024-10-11 01:34:58,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:58,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855908150] [2024-10-11 01:34:58,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:58,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:59,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855908150] [2024-10-11 01:34:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855908150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956886366] [2024-10-11 01:34:59,166 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 01:34:59,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:59,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:59,168 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:59,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 01:34:59,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 01:34:59,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:34:59,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-11 01:34:59,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:59,398 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-10-11 01:34:59,433 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 01:34:59,433 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-10-11 01:34:59,468 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 15 treesize of output 1 [2024-10-11 01:34:59,472 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-10-11 01:34:59,514 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-10-11 01:34:59,519 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-10-11 01:34:59,537 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 01:34:59,537 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 16 treesize of output 18 [2024-10-11 01:34:59,600 INFO L349 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2024-10-11 01:34:59,600 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 105 treesize of output 67 [2024-10-11 01:34:59,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-10-11 01:34:59,689 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-10-11 01:34:59,690 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 87 [2024-10-11 01:34:59,696 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 16 treesize of output 15 [2024-10-11 01:34:59,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:34:59,704 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 36 treesize of output 41 [2024-10-11 01:34:59,713 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 16 treesize of output 15 [2024-10-11 01:34:59,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2024-10-11 01:34:59,897 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-11 01:34:59,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 50 [2024-10-11 01:34:59,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-10-11 01:34:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:59,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:35:00,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:00,012 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 1 case distinctions, treesize of input 140 treesize of output 128 [2024-10-11 01:35:00,021 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:00,021 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 1 case distinctions, treesize of input 120 treesize of output 108 [2024-10-11 01:35:00,030 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 1028 treesize of output 912 [2024-10-11 01:35:00,416 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse12 |c_ULTIMATE.start_main_~t~0#1.base|))) (.cse4 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse3 (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse12 |c_ULTIMATE.start_main_~t~0#1.offset|)))) (and (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse1 (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_17 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~t~0#1.offset| (let ((.cse0 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17))) (select (select .cse0 .cse1) (+ (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4)))) (not (= 0 (select v_arrayElimArr_17 .cse4))))) (not (= (select v_arrayElimArr_16 .cse4) 0)) (= .cse1 0)))) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse6 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (forall ((v_arrayElimArr_17 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~t~0#1.base| (select (select .cse6 .cse7) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2) 4))) (not (= 0 (select v_arrayElimArr_17 .cse4))))) (not (= (select v_arrayElimArr_16 .cse4) 0)) (= .cse7 0))))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse4) 0)) (forall ((v_arrayElimArr_17 (Array Int Int))) (let ((.cse8 (select (select (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse8 0) (= |c_ULTIMATE.start_main_~t~0#1.base| (select (let ((.cse9 (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (+ .cse8 4))) (not (= 0 (select v_arrayElimArr_17 .cse4)))))))) (forall ((v_arrayElimArr_16 (Array Int Int))) (or (not (= (select v_arrayElimArr_16 .cse4) 0)) (forall ((v_arrayElimArr_17 (Array Int Int))) (let ((.cse11 (store .cse3 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_17))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= .cse10 0) (= |c_ULTIMATE.start_main_~t~0#1.offset| (select (select .cse11 (select (select (store .cse5 |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (+ .cse10 4))) (not (= 0 (select v_arrayElimArr_17 .cse4)))))))))))) is different from false [2024-10-11 01:35:00,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:00,514 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 1 case distinctions, treesize of input 349 treesize of output 318 [2024-10-11 01:35:00,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:00,526 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 1 case distinctions, treesize of input 381 treesize of output 350 [2024-10-11 01:35:00,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:00,990 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2024-10-11 01:35:00,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:00,999 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 81 [2024-10-11 01:35:01,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:01,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 420 treesize of output 413 [2024-10-11 01:35:01,722 INFO L349 Elim1Store]: treesize reduction 414, result has 57.9 percent of original size [2024-10-11 01:35:01,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 8193 treesize of output 7598 [2024-10-11 01:35:01,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:01,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 627 treesize of output 651 [2024-10-11 01:35:02,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:02,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 613 treesize of output 497 [2024-10-11 01:35:02,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:02,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 562 treesize of output 540 [2024-10-11 01:35:02,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:02,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 243