/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:52:03,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:52:03,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 21:52:03,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:52:03,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:52:03,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:52:03,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:52:03,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:52:03,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:52:03,777 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:52:03,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:52:03,777 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:52:03,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:52:03,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:52:03,779 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:52:03,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:52:03,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:52:03,779 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:52:03,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:52:03,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:52:03,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:52:03,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:52:03,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:52:03,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:52:03,780 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:52:03,780 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:52:03,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:52:03,781 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:52:03,781 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:52:03,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:52:03,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:52:03,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:52:03,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:52:03,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:52:03,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:52:03,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:52:03,784 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:52:03,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:52:03,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:52:03,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:52:03,977 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:52:03,977 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:52:03,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2023-12-15 21:52:05,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:52:05,195 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:52:05,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i [2023-12-15 21:52:05,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5377e9c8/1e0f45d02fef4803bd8ba4a9f626fd60/FLAG8964d7ddf [2023-12-15 21:52:05,222 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5377e9c8/1e0f45d02fef4803bd8ba4a9f626fd60 [2023-12-15 21:52:05,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:52:05,225 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:52:05,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:52:05,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:52:05,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:52:05,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,231 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552e71fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05, skipping insertion in model container [2023-12-15 21:52:05,231 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,264 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:52:05,440 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22317,22330] [2023-12-15 21:52:05,448 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22452,22465] [2023-12-15 21:52:05,450 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22612,22625] [2023-12-15 21:52:05,454 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22941,22954] [2023-12-15 21:52:05,454 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[23005,23018] [2023-12-15 21:52:05,456 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[23136,23149] [2023-12-15 21:52:05,457 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[23200,23213] [2023-12-15 21:52:05,464 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:52:05,472 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:52:05,499 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22317,22330] [2023-12-15 21:52:05,500 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22452,22465] [2023-12-15 21:52:05,501 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22612,22625] [2023-12-15 21:52:05,503 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[22941,22954] [2023-12-15 21:52:05,503 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[23005,23018] [2023-12-15 21:52:05,504 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[23136,23149] [2023-12-15 21:52:05,504 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-sorted-2.i[23200,23213] [2023-12-15 21:52:05,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:52:05,525 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:52:05,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05 WrapperNode [2023-12-15 21:52:05,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:52:05,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:52:05,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:52:05,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:52:05,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,541 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,563 INFO L138 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 198 [2023-12-15 21:52:05,563 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:52:05,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:52:05,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:52:05,564 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:52:05,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,590 INFO L175 MemorySlicer]: Split 32 memory accesses to 2 slices as follows [2, 30]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2023-12-15 21:52:05,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:52:05,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:52:05,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:52:05,607 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:52:05,608 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (1/1) ... [2023-12-15 21:52:05,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:52:05,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:52:05,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 21:52:05,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 21:52:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:52:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:52:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:52:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:52:05,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:52:05,772 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:52:05,775 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:52:06,032 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:52:06,053 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:52:06,053 INFO L309 CfgBuilder]: Removed 20 assume(true) statements. [2023-12-15 21:52:06,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:52:06 BoogieIcfgContainer [2023-12-15 21:52:06,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:52:06,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:52:06,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:52:06,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:52:06,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:52:05" (1/3) ... [2023-12-15 21:52:06,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9fe4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:52:06, skipping insertion in model container [2023-12-15 21:52:06,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:52:05" (2/3) ... [2023-12-15 21:52:06,061 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9fe4cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:52:06, skipping insertion in model container [2023-12-15 21:52:06,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:52:06" (3/3) ... [2023-12-15 21:52:06,062 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2023-12-15 21:52:06,074 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:52:06,074 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-15 21:52:06,110 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:52:06,115 INFO L357 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, mHoare=true, 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;@709ec247, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:52:06,115 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-15 21:52:06,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 58 states have internal predecessors, (97), 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) [2023-12-15 21:52:06,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-15 21:52:06,122 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:06,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-15 21:52:06,122 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:06,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash 264929569, now seen corresponding path program 1 times [2023-12-15 21:52:06,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:06,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370265605] [2023-12-15 21:52:06,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:06,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:06,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:06,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370265605] [2023-12-15 21:52:06,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370265605] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:52:06,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:52:06,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:52:06,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526537987] [2023-12-15 21:52:06,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:52:06,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:52:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:06,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:52:06,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:52:06,284 INFO L87 Difference]: Start difference. First operand has 59 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 58 states have internal predecessors, (97), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-12-15 21:52:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:52:06,312 INFO L93 Difference]: Finished difference Result 113 states and 185 transitions. [2023-12-15 21:52:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:52:06,314 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-15 21:52:06,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:52:06,319 INFO L225 Difference]: With dead ends: 113 [2023-12-15 21:52:06,319 INFO L226 Difference]: Without dead ends: 55 [2023-12-15 21:52:06,322 INFO L412 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 [2023-12-15 21:52:06,325 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:52:06,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:52:06,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-15 21:52:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-15 21:52:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 54 states have internal predecessors, (65), 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) [2023-12-15 21:52:06,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2023-12-15 21:52:06,355 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 5 [2023-12-15 21:52:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:52:06,355 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2023-12-15 21:52:06,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) [2023-12-15 21:52:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2023-12-15 21:52:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-15 21:52:06,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:06,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-15 21:52:06,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:52:06,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:06,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash -395206852, now seen corresponding path program 1 times [2023-12-15 21:52:06,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:06,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83873015] [2023-12-15 21:52:06,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:06,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:06,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83873015] [2023-12-15 21:52:06,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83873015] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:52:06,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:52:06,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:52:06,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563184528] [2023-12-15 21:52:06,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:52:06,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:52:06,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:06,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:52:06,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:52:06,422 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:52:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:52:06,463 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2023-12-15 21:52:06,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:52:06,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-15 21:52:06,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:52:06,465 INFO L225 Difference]: With dead ends: 114 [2023-12-15 21:52:06,465 INFO L226 Difference]: Without dead ends: 60 [2023-12-15 21:52:06,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:52:06,467 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:52:06,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 83 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:52:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-15 21:52:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2023-12-15 21:52:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 58 states have internal predecessors, (70), 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) [2023-12-15 21:52:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2023-12-15 21:52:06,478 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 6 [2023-12-15 21:52:06,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:52:06,478 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2023-12-15 21:52:06,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:52:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2023-12-15 21:52:06,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-15 21:52:06,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:06,479 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:52:06,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:52:06,479 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:06,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:06,480 INFO L85 PathProgramCache]: Analyzing trace with hash 338976657, now seen corresponding path program 1 times [2023-12-15 21:52:06,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:06,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431357657] [2023-12-15 21:52:06,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:06,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:06,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 21:52:06,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:06,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431357657] [2023-12-15 21:52:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431357657] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:52:06,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:52:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:52:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968486889] [2023-12-15 21:52:06,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:52:06,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:52:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:06,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:52:06,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:52:06,569 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2023-12-15 21:52:06,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:52:06,661 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2023-12-15 21:52:06,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:52:06,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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 10 [2023-12-15 21:52:06,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:52:06,662 INFO L225 Difference]: With dead ends: 98 [2023-12-15 21:52:06,662 INFO L226 Difference]: Without dead ends: 96 [2023-12-15 21:52:06,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:52:06,663 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 153 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:52:06,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 71 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:52:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-15 21:52:06,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 57. [2023-12-15 21:52:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 56 states have internal predecessors, (68), 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) [2023-12-15 21:52:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-12-15 21:52:06,670 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 10 [2023-12-15 21:52:06,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:52:06,670 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-12-15 21:52:06,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 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) [2023-12-15 21:52:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-12-15 21:52:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-15 21:52:06,670 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:06,670 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:52:06,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:52:06,671 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:06,671 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 702330627, now seen corresponding path program 1 times [2023-12-15 21:52:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:06,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108754455] [2023-12-15 21:52:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:07,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108754455] [2023-12-15 21:52:07,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108754455] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:52:07,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919964651] [2023-12-15 21:52:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:07,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:07,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:52:07,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:52:07,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 21:52:07,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:07,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 21:52:07,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:52:07,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 [2023-12-15 21:52:07,406 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 [2023-12-15 21:52:07,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:07,454 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-15 21:52:07,470 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:52:07,471 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 16 treesize of output 15 [2023-12-15 21:52:07,490 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:52:07,490 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 [2023-12-15 21:52:07,518 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 [2023-12-15 21:52:07,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:07,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:52:07,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_127) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)) is different from false [2023-12-15 21:52:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:07,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919964651] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:52:07,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:52:07,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-12-15 21:52:07,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307873844] [2023-12-15 21:52:07,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:52:07,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-15 21:52:07,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:07,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-15 21:52:07,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=205, Unknown=1, NotChecked=28, Total=272 [2023-12-15 21:52:07,711 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 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) [2023-12-15 21:52:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:52:09,170 INFO L93 Difference]: Finished difference Result 250 states and 304 transitions. [2023-12-15 21:52:09,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-15 21:52:09,170 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 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 [2023-12-15 21:52:09,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:52:09,172 INFO L225 Difference]: With dead ends: 250 [2023-12-15 21:52:09,172 INFO L226 Difference]: Without dead ends: 194 [2023-12-15 21:52:09,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=964, Unknown=1, NotChecked=66, Total=1260 [2023-12-15 21:52:09,173 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 389 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 21:52:09,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1026 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 681 Invalid, 0 Unknown, 202 Unchecked, 0.9s Time] [2023-12-15 21:52:09,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-15 21:52:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 79. [2023-12-15 21:52:09,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 78 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:52:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2023-12-15 21:52:09,184 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 17 [2023-12-15 21:52:09,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:52:09,184 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2023-12-15 21:52:09,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 16 states have internal predecessors, (48), 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) [2023-12-15 21:52:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2023-12-15 21:52:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 21:52:09,185 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:09,185 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:52:09,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:52:09,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:09,397 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:09,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:09,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1251712327, now seen corresponding path program 1 times [2023-12-15 21:52:09,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:09,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062684441] [2023-12-15 21:52:09,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:09,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:09,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062684441] [2023-12-15 21:52:09,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062684441] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:52:09,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341305620] [2023-12-15 21:52:09,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:09,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:09,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:52:09,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:52:09,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 21:52:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:09,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-15 21:52:09,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:52:09,919 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 [2023-12-15 21:52:09,934 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-15 21:52:09,942 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:52:09,942 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 16 treesize of output 15 [2023-12-15 21:52:09,946 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 [2023-12-15 21:52:09,954 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:52:09,954 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 [2023-12-15 21:52:09,960 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-15 21:52:09,964 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 [2023-12-15 21:52:09,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:52:09,988 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 60 treesize of output 53 [2023-12-15 21:52:09,997 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 [2023-12-15 21:52:10,002 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 19 treesize of output 11 [2023-12-15 21:52:10,098 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 [2023-12-15 21:52:10,106 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 [2023-12-15 21:52:10,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:10,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:52:10,160 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 69 treesize of output 49 [2023-12-15 21:52:10,164 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_200 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_199 (Array Int Int))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_199) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-15 21:52:10,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:10,177 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 37 treesize of output 38 [2023-12-15 21:52:10,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:10,183 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 [2023-12-15 21:52:10,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:10,190 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 64 treesize of output 47 [2023-12-15 21:52:10,194 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 29 treesize of output 27 [2023-12-15 21:52:10,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:10,203 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 48 treesize of output 51 [2023-12-15 21:52:10,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2023-12-15 21:52:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341305620] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:52:10,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:52:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2023-12-15 21:52:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580698499] [2023-12-15 21:52:10,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:52:10,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-15 21:52:10,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:10,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-15 21:52:10,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=175, Unknown=1, NotChecked=26, Total=240 [2023-12-15 21:52:10,260 INFO L87 Difference]: Start difference. First operand 79 states and 98 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 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) [2023-12-15 21:52:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:52:10,565 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2023-12-15 21:52:10,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:52:10,566 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 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 [2023-12-15 21:52:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:52:10,567 INFO L225 Difference]: With dead ends: 117 [2023-12-15 21:52:10,567 INFO L226 Difference]: Without dead ends: 115 [2023-12-15 21:52:10,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=306, Unknown=1, NotChecked=36, Total=420 [2023-12-15 21:52:10,568 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:52:10,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 480 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 315 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2023-12-15 21:52:10,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-15 21:52:10,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 91. [2023-12-15 21:52:10,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 90 states have internal predecessors, (113), 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) [2023-12-15 21:52:10,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2023-12-15 21:52:10,580 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 20 [2023-12-15 21:52:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:52:10,580 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2023-12-15 21:52:10,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 15 states have internal predecessors, (52), 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) [2023-12-15 21:52:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2023-12-15 21:52:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:52:10,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:10,581 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:52:10,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 21:52:10,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:10,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:10,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:10,787 INFO L85 PathProgramCache]: Analyzing trace with hash 148782236, now seen corresponding path program 1 times [2023-12-15 21:52:10,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:10,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861712696] [2023-12-15 21:52:10,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:11,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861712696] [2023-12-15 21:52:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861712696] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:52:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014214299] [2023-12-15 21:52:11,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:11,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:11,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:52:11,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:52:11,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 21:52:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:11,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-15 21:52:11,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:52:11,476 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 [2023-12-15 21:52:11,491 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-15 21:52:11,499 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:52:11,500 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 16 treesize of output 15 [2023-12-15 21:52:11,503 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 [2023-12-15 21:52:11,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-15 21:52:11,519 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:52:11,520 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 16 treesize of output 15 [2023-12-15 21:52:11,541 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:52:11,541 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 [2023-12-15 21:52:11,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:52:11,592 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 [2023-12-15 21:52:11,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-15 21:52:11,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:11,651 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-12-15 21:52:11,652 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 95 [2023-12-15 21:52:11,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:11,662 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:52:11,663 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 1 case distinctions, treesize of input 29 treesize of output 15 [2023-12-15 21:52:11,673 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:52:11,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-12-15 21:52:11,677 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-15 21:52:11,680 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 20 treesize of output 15 [2023-12-15 21:52:11,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:11,689 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 91 treesize of output 72 [2023-12-15 21:52:11,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:11,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:11,693 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 [2023-12-15 21:52:11,698 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-12-15 21:52:11,727 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 20 treesize of output 15 [2023-12-15 21:52:11,732 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 [2023-12-15 21:52:11,734 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 36 treesize of output 27 [2023-12-15 21:52:11,830 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 20 treesize of output 12 [2023-12-15 21:52:11,833 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 [2023-12-15 21:52:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:11,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:52:11,897 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int)) (v_ArrVal_324 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_324) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) 0)) is different from false [2023-12-15 21:52:11,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:11,946 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 2 case distinctions, treesize of input 45 treesize of output 51 [2023-12-15 21:52:11,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:11,953 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 86 treesize of output 85 [2023-12-15 21:52:11,963 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 31 treesize of output 17 [2023-12-15 21:52:13,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:13,301 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 95 treesize of output 96 [2023-12-15 21:52:13,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:13,307 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 87 treesize of output 80 [2023-12-15 21:52:13,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:13,316 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 312 treesize of output 219 [2023-12-15 21:52:13,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:13,329 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 190 treesize of output 193 [2023-12-15 21:52:13,338 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 177 treesize of output 173 [2023-12-15 21:52:13,343 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 173 treesize of output 171 [2023-12-15 21:52:13,353 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 171 treesize of output 169 [2023-12-15 21:52:13,357 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 169 treesize of output 165 [2023-12-15 21:52:13,367 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 165 treesize of output 163 [2023-12-15 21:52:13,372 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 163 treesize of output 159 [2023-12-15 21:52:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-15 21:52:13,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014214299] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:52:13,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:52:13,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-12-15 21:52:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581150891] [2023-12-15 21:52:13,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:52:13,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 21:52:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:13,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 21:52:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=354, Unknown=2, NotChecked=38, Total=462 [2023-12-15 21:52:13,710 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 21 states have internal predecessors, (57), 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) [2023-12-15 21:52:26,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-15 21:52:30,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-15 21:52:31,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:52:31,339 INFO L93 Difference]: Finished difference Result 210 states and 255 transitions. [2023-12-15 21:52:31,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 21:52:31,339 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 21 states have internal predecessors, (57), 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 24 [2023-12-15 21:52:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:52:31,340 INFO L225 Difference]: With dead ends: 210 [2023-12-15 21:52:31,340 INFO L226 Difference]: Without dead ends: 175 [2023-12-15 21:52:31,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=4, NotChecked=54, Total=870 [2023-12-15 21:52:31,341 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 244 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 30 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-15 21:52:31,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 503 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 368 Invalid, 3 Unknown, 153 Unchecked, 8.8s Time] [2023-12-15 21:52:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-15 21:52:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2023-12-15 21:52:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 104 states have internal predecessors, (131), 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) [2023-12-15 21:52:31,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 131 transitions. [2023-12-15 21:52:31,352 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 131 transitions. Word has length 24 [2023-12-15 21:52:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:52:31,352 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 131 transitions. [2023-12-15 21:52:31,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 21 states have internal predecessors, (57), 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) [2023-12-15 21:52:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2023-12-15 21:52:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:52:31,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:31,353 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:52:31,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 21:52:31,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:31,560 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:31,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:31,560 INFO L85 PathProgramCache]: Analyzing trace with hash -660564390, now seen corresponding path program 1 times [2023-12-15 21:52:31,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:31,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039834005] [2023-12-15 21:52:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:31,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-15 21:52:31,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:31,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039834005] [2023-12-15 21:52:31,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039834005] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:52:31,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:52:31,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:52:31,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990163088] [2023-12-15 21:52:31,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:52:31,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:52:31,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:31,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:52:31,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:52:31,637 INFO L87 Difference]: Start difference. First operand 105 states and 131 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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) [2023-12-15 21:52:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:52:31,695 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2023-12-15 21:52:31,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:52:31,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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 24 [2023-12-15 21:52:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:52:31,696 INFO L225 Difference]: With dead ends: 154 [2023-12-15 21:52:31,696 INFO L226 Difference]: Without dead ends: 116 [2023-12-15 21:52:31,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:52:31,697 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:52:31,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 142 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:52:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-15 21:52:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2023-12-15 21:52:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 108 states have internal predecessors, (135), 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) [2023-12-15 21:52:31,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2023-12-15 21:52:31,707 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 24 [2023-12-15 21:52:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:52:31,707 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2023-12-15 21:52:31,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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) [2023-12-15 21:52:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2023-12-15 21:52:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 21:52:31,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:52:31,708 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:52:31,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:52:31,708 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:52:31,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:52:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1044619042, now seen corresponding path program 1 times [2023-12-15 21:52:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:52:31,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935162731] [2023-12-15 21:52:31,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:52:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:32,227 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:32,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:52:32,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935162731] [2023-12-15 21:52:32,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935162731] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:52:32,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578037368] [2023-12-15 21:52:32,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:52:32,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:52:32,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:52:32,230 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:52:32,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 21:52:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:52:32,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-15 21:52:32,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:52:32,344 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 [2023-12-15 21:52:32,366 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:52:32,366 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 [2023-12-15 21:52:32,373 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-15 21:52:32,375 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 [2023-12-15 21:52:32,380 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-15 21:52:32,383 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 [2023-12-15 21:52:32,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:52:32,408 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 [2023-12-15 21:52:32,413 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 [2023-12-15 21:52:32,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:32,481 INFO L349 Elim1Store]: treesize reduction 44, result has 10.2 percent of original size [2023-12-15 21:52:32,482 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 76 [2023-12-15 21:52:32,492 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:52:32,492 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 1 case distinctions, treesize of input 29 treesize of output 15 [2023-12-15 21:52:32,498 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-15 21:52:32,500 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 20 treesize of output 15 [2023-12-15 21:52:32,509 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:52:32,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-12-15 21:52:32,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:52:32,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 53 [2023-12-15 21:52:32,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-12-15 21:52:32,521 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:52:32,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 5 [2023-12-15 21:52:32,527 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2023-12-15 21:52:32,559 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 36 treesize of output 27 [2023-12-15 21:52:32,565 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 [2023-12-15 21:52:32,569 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 20 treesize of output 15 [2023-12-15 21:52:32,692 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 [2023-12-15 21:52:32,695 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 [2023-12-15 21:52:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:52:32,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:52:32,759 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_502 (Array Int Int)) (v_ArrVal_501 (Array Int Int)) (v_ArrVal_503 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_502) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_503) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_501) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 1)) is different from false [2023-12-15 21:52:32,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:32,823 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 2 case distinctions, treesize of input 45 treesize of output 51 [2023-12-15 21:52:32,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:32,832 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 86 treesize of output 85 [2023-12-15 21:52:32,838 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 31 treesize of output 17 [2023-12-15 21:52:32,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:32,962 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 95 treesize of output 96 [2023-12-15 21:52:32,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:32,967 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 87 treesize of output 80 [2023-12-15 21:52:32,975 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:32,975 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 312 treesize of output 219 [2023-12-15 21:52:32,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:52:32,988 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 190 treesize of output 193 [2023-12-15 21:52:32,994 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 177 treesize of output 173 [2023-12-15 21:52:32,998 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 173 treesize of output 171 [2023-12-15 21:52:33,003 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 171 treesize of output 167 [2023-12-15 21:52:33,007 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 167 treesize of output 163 [2023-12-15 21:52:33,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 163 treesize of output 161 [2023-12-15 21:52:33,027 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 161 treesize of output 159 [2023-12-15 21:52:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-12-15 21:52:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578037368] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:52:33,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:52:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-12-15 21:52:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745309305] [2023-12-15 21:52:33,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:52:33,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 21:52:33,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:52:33,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 21:52:33,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=350, Unknown=2, NotChecked=38, Total=462 [2023-12-15 21:52:33,301 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 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) [2023-12-15 21:52:40,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-15 21:52:52,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-15 21:52:53,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-15 21:52:57,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-15 21:53:01,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-15 21:53:02,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:02,329 INFO L93 Difference]: Finished difference Result 177 states and 216 transitions. [2023-12-15 21:53:02,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 21:53:02,330 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 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 24 [2023-12-15 21:53:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:02,330 INFO L225 Difference]: With dead ends: 177 [2023-12-15 21:53:02,330 INFO L226 Difference]: Without dead ends: 175 [2023-12-15 21:53:02,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=173, Invalid=818, Unknown=5, NotChecked=60, Total=1056 [2023-12-15 21:53:02,331 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 234 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 33 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:02,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 531 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 429 Invalid, 7 Unknown, 134 Unchecked, 17.1s Time] [2023-12-15 21:53:02,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-12-15 21:53:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 102. [2023-12-15 21:53:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 101 states have internal predecessors, (127), 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) [2023-12-15 21:53:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2023-12-15 21:53:02,340 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 24 [2023-12-15 21:53:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:02,340 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2023-12-15 21:53:02,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 21 states have internal predecessors, (64), 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) [2023-12-15 21:53:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2023-12-15 21:53:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:53:02,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:02,341 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:02,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-15 21:53:02,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:02,546 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:53:02,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:02,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1571921691, now seen corresponding path program 1 times [2023-12-15 21:53:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:02,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246445673] [2023-12-15 21:53:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:02,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:53:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246445673] [2023-12-15 21:53:02,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246445673] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:02,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246919764] [2023-12-15 21:53:02,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:02,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:02,813 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:53:02,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 21:53:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:02,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-15 21:53:02,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:53:02,936 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 [2023-12-15 21:53:02,942 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 [2023-12-15 21:53:02,971 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-15 21:53:03,000 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:53:03,000 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 16 treesize of output 15 [2023-12-15 21:53:03,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:53:03,012 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 [2023-12-15 21:53:03,034 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 [2023-12-15 21:53:03,127 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 20 treesize of output 16 [2023-12-15 21:53:03,137 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 20 treesize of output 16 [2023-12-15 21:53:03,153 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:53:03,153 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 16 treesize of output 15 [2023-12-15 21:53:03,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:03,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:53:03,198 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 30 treesize of output 27 [2023-12-15 21:53:03,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 15 [2023-12-15 21:53:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:53:03,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:53:03,281 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 41 treesize of output 37 [2023-12-15 21:53:03,286 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 37 treesize of output 33 [2023-12-15 21:53:03,304 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4))) (and (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.base_12| Int)) (let ((.cse0 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_12| v_ArrVal_629))) (or (not (= v_ArrVal_628 (store (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_628 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_~tmp~0#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|)))) (or (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1.base_12| Int)) (let ((.cse2 (store |c_#memory_int#1| |v_ULTIMATE.start_main_~tmp~0#1.base_12| v_ArrVal_629))) (or (not (= v_ArrVal_628 (store (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_628 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) 0))))))) is different from false [2023-12-15 21:53:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:53:12,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246919764] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:53:12,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:53:12,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 21 [2023-12-15 21:53:12,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403028063] [2023-12-15 21:53:12,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:53:12,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-15 21:53:12,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:53:12,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-15 21:53:12,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=335, Unknown=14, NotChecked=38, Total=462 [2023-12-15 21:53:12,447 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:53:12,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:53:12,896 INFO L93 Difference]: Finished difference Result 225 states and 274 transitions. [2023-12-15 21:53:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:53:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 21:53:12,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:53:12,897 INFO L225 Difference]: With dead ends: 225 [2023-12-15 21:53:12,897 INFO L226 Difference]: Without dead ends: 160 [2023-12-15 21:53:12,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=174, Invalid=570, Unknown=16, NotChecked=52, Total=812 [2023-12-15 21:53:12,898 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 362 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:53:12,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 590 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 362 Invalid, 0 Unknown, 110 Unchecked, 0.3s Time] [2023-12-15 21:53:12,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-15 21:53:12,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 124. [2023-12-15 21:53:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 123 states have internal predecessors, (152), 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) [2023-12-15 21:53:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2023-12-15 21:53:12,932 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 26 [2023-12-15 21:53:12,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:53:12,934 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2023-12-15 21:53:12,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1363636363636362) internal successors, (69), 21 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:53:12,934 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2023-12-15 21:53:12,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:53:12,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:53:12,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:12,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 21:53:13,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:13,141 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-12-15 21:53:13,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:53:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash 960418098, now seen corresponding path program 1 times [2023-12-15 21:53:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:53:13,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767997861] [2023-12-15 21:53:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:53:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:13,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:53:13,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:53:13,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767997861] [2023-12-15 21:53:13,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767997861] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:53:13,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362273735] [2023-12-15 21:53:13,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:53:13,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:13,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:53:13,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 21:53:13,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 21:53:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:53:13,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-15 21:53:13,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:53:13,530 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 [2023-12-15 21:53:13,560 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-12-15 21:53:13,560 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 1 case distinctions, treesize of input 27 treesize of output 19 [2023-12-15 21:53:13,573 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-15 21:53:13,573 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 1 case distinctions, treesize of input 27 treesize of output 15 [2023-12-15 21:53:13,581 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:53:13,581 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 [2023-12-15 21:53:13,616 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-15 21:53:13,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 58 [2023-12-15 21:53:13,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2023-12-15 21:53:13,834 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:53:13,834 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:53:13,918 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4))) (and (forall ((v_ArrVal_701 (Array Int Int))) (or (forall ((v_ArrVal_702 (Array Int Int))) (or (not (= v_ArrVal_702 (store .cse0 .cse1 (select v_ArrVal_702 .cse1)))) (= (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_701))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) (not (= v_ArrVal_701 (store .cse3 .cse1 (select v_ArrVal_701 .cse1)))))) (forall ((v_ArrVal_701 (Array Int Int))) (or (forall ((v_ArrVal_702 (Array Int Int))) (or (not (= v_ArrVal_702 (store .cse0 .cse1 (select v_ArrVal_702 .cse1)))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_702))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_701) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) (not (= v_ArrVal_701 (store .cse3 .cse1 (select v_ArrVal_701 .cse1)))))))) is different from false [2023-12-15 21:53:13,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:53:13,950 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 187 treesize of output 156 [2023-12-15 21:53:14,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:53:14,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 386 treesize of output 414 [2023-12-15 21:53:14,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:53:14,019 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 305 treesize of output 242 [2023-12-15 21:53:14,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:53:14,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 424 treesize of output 488 [2023-12-15 21:53:14,179 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 6 treesize of output 4 [2023-12-15 21:53:14,489 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 13 treesize of output 3 [2023-12-15 21:53:15,459 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 18 treesize of output 12 [2023-12-15 21:53:15,565 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 13 treesize of output 9 [2023-12-15 21:53:16,104 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 20 treesize of output 14 [2023-12-15 21:53:16,264 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 5 [2023-12-15 21:53:16,617 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 13 treesize of output 9 [2023-12-15 21:53:16,905 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 15 treesize of output 11 [2023-12-15 21:53:17,198 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 20 treesize of output 14 [2023-12-15 21:53:17,236 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 27 Received shutdown request... [2023-12-15 21:53:17,550 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:53:17,552 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-12-15 21:53:17,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-15 21:53:17,562 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:53:17,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:53:17,756 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. [2023-12-15 21:53:17,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-12-15 21:53:17,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-12-15 21:53:17,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-12-15 21:53:17,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2023-12-15 21:53:17,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-12-15 21:53:17,758 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-12-15 21:53:17,761 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:53:17,762 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:53:17,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:53:17 BoogieIcfgContainer [2023-12-15 21:53:17,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:53:17,764 INFO L158 Benchmark]: Toolchain (without parser) took 72538.84ms. Allocated memory was 272.6MB in the beginning and 393.2MB in the end (delta: 120.6MB). Free memory was 227.8MB in the beginning and 348.9MB in the end (delta: -121.1MB). Peak memory consumption was 233.9MB. Max. memory is 8.0GB. [2023-12-15 21:53:17,764 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:53:17,764 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.20ms. Allocated memory is still 272.6MB. Free memory was 227.8MB in the beginning and 207.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 21:53:17,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.41ms. Allocated memory is still 272.6MB. Free memory was 207.9MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:53:17,765 INFO L158 Benchmark]: Boogie Preprocessor took 43.29ms. Allocated memory is still 272.6MB. Free memory was 205.8MB in the beginning and 202.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:53:17,765 INFO L158 Benchmark]: RCFGBuilder took 446.09ms. Allocated memory is still 272.6MB. Free memory was 202.7MB in the beginning and 183.2MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 21:53:17,765 INFO L158 Benchmark]: TraceAbstraction took 71709.11ms. Allocated memory was 272.6MB in the beginning and 393.2MB in the end (delta: 120.6MB). Free memory was 182.7MB in the beginning and 348.9MB in the end (delta: -166.1MB). Peak memory consumption was 188.8MB. Max. memory is 8.0GB. [2023-12-15 21:53:17,766 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 300.20ms. Allocated memory is still 272.6MB. Free memory was 227.8MB in the beginning and 207.9MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.41ms. Allocated memory is still 272.6MB. Free memory was 207.9MB in the beginning and 205.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.29ms. Allocated memory is still 272.6MB. Free memory was 205.8MB in the beginning and 202.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 446.09ms. Allocated memory is still 272.6MB. Free memory was 202.7MB in the beginning and 183.2MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 71709.11ms. Allocated memory was 272.6MB in the beginning and 393.2MB in the end (delta: 120.6MB). Free memory was 182.7MB in the beginning and 348.9MB in the end (delta: -166.1MB). Peak memory consumption was 188.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1036]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1036). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1024). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1029). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 1055]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1055). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 1056]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1056). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 1062]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1062). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. - TimeoutResultAtElement [Line: 1063]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1063). Cancelled while NwaCegarLoop was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-3-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-18-4-4-2-3-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 59 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 71.7s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 49.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 1497 SdHoareTripleChecker+Valid, 27.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1497 mSDsluCounter, 3494 SdHoareTripleChecker+Invalid, 27.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 679 IncrementalHoareTripleChecker+Unchecked, 2985 mSDsCounter, 201 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2260 IncrementalHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 201 mSolverCounterUnsat, 509 mSDtfsCounter, 2260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 174 SyntacticMatches, 7 SemanticMatches, 147 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 32.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=9, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 365 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 359 ConstructedInterpolants, 42 QuantifiedInterpolants, 7832 SizeOfPredicates, 61 NumberOfNonLiveVariables, 941 ConjunctsInSsa, 225 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 10/76 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown