/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/dll-queue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:50:32,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:50:32,774 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:50:32,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:50:32,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:50:32,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:50:32,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:50:32,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:50:32,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:50:32,810 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:50:32,811 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:50:32,811 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:50:32,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:50:32,812 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:50:32,813 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:50:32,813 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:50:32,813 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:50:32,813 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:50:32,814 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:50:32,814 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:50:32,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:50:32,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:50:32,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:50:32,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:50:32,815 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:50:32,815 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:50:32,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:50:32,815 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:50:32,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:50:32,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:50:32,817 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:50:32,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:50:32,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:32,818 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:50:32,818 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:50:32,818 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:50:32,818 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:50:32,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:50:32,818 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:50:32,819 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:50:32,819 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:50:32,819 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:50:32,819 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:50:32,819 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:50:33,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:50:33,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:50:33,071 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:50:33,071 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:50:33,072 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:50:33,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue-1.i [2023-12-15 21:50:34,280 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:50:34,488 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:50:34,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-queue-1.i [2023-12-15 21:50:34,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99edeb75/7b6fdc68c42943f1bf1616f2d39510ea/FLAG364a77b1a [2023-12-15 21:50:34,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e99edeb75/7b6fdc68c42943f1bf1616f2d39510ea [2023-12-15 21:50:34,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:50:34,526 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:50:34,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:34,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:50:34,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:50:34,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:34,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@539012bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34, skipping insertion in model container [2023-12-15 21:50:34,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:34,596 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:50:34,856 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/dll-queue-1.i[22460,22473] [2023-12-15 21:50:34,863 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/dll-queue-1.i[22531,22544] [2023-12-15 21:50:34,865 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/dll-queue-1.i[22605,22618] [2023-12-15 21:50:34,865 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/dll-queue-1.i[22697,22710] [2023-12-15 21:50:34,866 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/dll-queue-1.i[22774,22787] [2023-12-15 21:50:34,867 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/dll-queue-1.i[22869,22882] [2023-12-15 21:50:34,868 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/dll-queue-1.i[22946,22959] [2023-12-15 21:50:34,869 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/dll-queue-1.i[23029,23042] [2023-12-15 21:50:34,870 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/dll-queue-1.i[23124,23137] [2023-12-15 21:50:34,871 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/dll-queue-1.i[23201,23214] [2023-12-15 21:50:34,871 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/dll-queue-1.i[23284,23297] [2023-12-15 21:50:34,873 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/dll-queue-1.i[23373,23386] [2023-12-15 21:50:34,875 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/dll-queue-1.i[23459,23472] [2023-12-15 21:50:34,877 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/dll-queue-1.i[23604,23617] [2023-12-15 21:50:34,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:34,894 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:50:34,940 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/dll-queue-1.i[22460,22473] [2023-12-15 21:50:34,942 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/dll-queue-1.i[22531,22544] [2023-12-15 21:50:34,943 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/dll-queue-1.i[22605,22618] [2023-12-15 21:50:34,946 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/dll-queue-1.i[22697,22710] [2023-12-15 21:50:34,947 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/dll-queue-1.i[22774,22787] [2023-12-15 21:50:34,949 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/dll-queue-1.i[22869,22882] [2023-12-15 21:50:34,950 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/dll-queue-1.i[22946,22959] [2023-12-15 21:50:34,951 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/dll-queue-1.i[23029,23042] [2023-12-15 21:50:34,952 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/dll-queue-1.i[23124,23137] [2023-12-15 21:50:34,954 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/dll-queue-1.i[23201,23214] [2023-12-15 21:50:34,954 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/dll-queue-1.i[23284,23297] [2023-12-15 21:50:34,956 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/dll-queue-1.i[23373,23386] [2023-12-15 21:50:34,957 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/dll-queue-1.i[23459,23472] [2023-12-15 21:50:34,959 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/dll-queue-1.i[23604,23617] [2023-12-15 21:50:34,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:34,991 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:50:34,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34 WrapperNode [2023-12-15 21:50:34,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:34,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:34,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:50:34,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:50:34,999 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:50:34" (1/1) ... [2023-12-15 21:50:35,026 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:50:34" (1/1) ... [2023-12-15 21:50:35,059 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2023-12-15 21:50:35,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:35,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:50:35,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:50:35,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:50:35,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,091 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2023-12-15 21:50:35,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,098 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,105 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:50:35,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:50:35,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:50:35,110 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:50:35,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (1/1) ... [2023-12-15 21:50:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:35,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:35,146 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:50:35,153 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:50:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:50:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:50:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:50:35,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:50:35,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:50:35,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:50:35,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:50:35,263 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:50:35,265 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:50:35,490 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:50:35,515 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:50:35,515 INFO L309 CfgBuilder]: Removed 31 assume(true) statements. [2023-12-15 21:50:35,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:35 BoogieIcfgContainer [2023-12-15 21:50:35,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:50:35,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:50:35,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:50:35,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:50:35,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:50:34" (1/3) ... [2023-12-15 21:50:35,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb9a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:35, skipping insertion in model container [2023-12-15 21:50:35,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:34" (2/3) ... [2023-12-15 21:50:35,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39cb9a81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:35, skipping insertion in model container [2023-12-15 21:50:35,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:35" (3/3) ... [2023-12-15 21:50:35,522 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i [2023-12-15 21:50:35,538 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:50:35,538 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-12-15 21:50:35,575 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:50:35,580 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;@42fefe3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:50:35,580 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-12-15 21:50:35,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 67 states have (on average 2.044776119402985) internal successors, (137), 81 states have internal predecessors, (137), 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:50:35,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-15 21:50:35,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:35,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-15 21:50:35,590 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:35,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:35,595 INFO L85 PathProgramCache]: Analyzing trace with hash 11235370, now seen corresponding path program 1 times [2023-12-15 21:50:35,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:35,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868734668] [2023-12-15 21:50:35,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:35,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:35,817 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:50:35,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:35,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868734668] [2023-12-15 21:50:35,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868734668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:35,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:35,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:50:35,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118915590] [2023-12-15 21:50:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:35,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:50:35,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:35,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:50:35,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:50:35,856 INFO L87 Difference]: Start difference. First operand has 82 states, 67 states have (on average 2.044776119402985) internal successors, (137), 81 states have internal predecessors, (137), 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.0) internal successors, (4), 2 states have internal predecessors, (4), 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:50:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:35,902 INFO L93 Difference]: Finished difference Result 163 states and 273 transitions. [2023-12-15 21:50:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:50:35,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2023-12-15 21:50:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:35,913 INFO L225 Difference]: With dead ends: 163 [2023-12-15 21:50:35,913 INFO L226 Difference]: Without dead ends: 79 [2023-12-15 21:50:35,916 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:50:35,920 INFO L413 NwaCegarLoop]: 90 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, 90 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:50:35,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-15 21:50:35,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-15 21:50:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.353846153846154) internal successors, (88), 78 states have internal predecessors, (88), 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:50:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2023-12-15 21:50:35,962 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 4 [2023-12-15 21:50:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:35,963 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2023-12-15 21:50:35,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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:50:35,963 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2023-12-15 21:50:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-15 21:50:35,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:35,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-15 21:50:35,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:50:35,964 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:35,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash 346540763, now seen corresponding path program 1 times [2023-12-15 21:50:35,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447414908] [2023-12-15 21:50:35,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,065 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:50:36,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447414908] [2023-12-15 21:50:36,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447414908] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:36,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:36,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:50:36,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801628716] [2023-12-15 21:50:36,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:36,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:36,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:36,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:36,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:36,071 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) 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:50:36,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:36,123 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2023-12-15 21:50:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:36,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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:50:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:36,131 INFO L225 Difference]: With dead ends: 79 [2023-12-15 21:50:36,131 INFO L226 Difference]: Without dead ends: 69 [2023-12-15 21:50:36,132 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:50:36,134 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:36,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 64 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:36,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-15 21:50:36,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-12-15 21:50:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 60 states have (on average 1.3) internal successors, (78), 68 states have internal predecessors, (78), 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:50:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2023-12-15 21:50:36,143 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 5 [2023-12-15 21:50:36,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:36,143 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2023-12-15 21:50:36,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) 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:50:36,144 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2023-12-15 21:50:36,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-15 21:50:36,148 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:36,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:36,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:50:36,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:36,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1300016296, now seen corresponding path program 1 times [2023-12-15 21:50:36,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973961134] [2023-12-15 21:50:36,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,467 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:50:36,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973961134] [2023-12-15 21:50:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973961134] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:36,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:36,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:36,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731788233] [2023-12-15 21:50:36,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:36,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:36,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:36,469 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:36,574 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2023-12-15 21:50:36,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:50:36,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-15 21:50:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:36,579 INFO L225 Difference]: With dead ends: 118 [2023-12-15 21:50:36,579 INFO L226 Difference]: Without dead ends: 116 [2023-12-15 21:50:36,580 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:50:36,582 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 159 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:36,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 121 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-15 21:50:36,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 67. [2023-12-15 21:50:36,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 66 states have internal predecessors, (76), 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:50:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2023-12-15 21:50:36,605 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 8 [2023-12-15 21:50:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:36,605 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2023-12-15 21:50:36,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:36,605 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2023-12-15 21:50:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-15 21:50:36,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:36,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:36,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:50:36,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:36,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1331859152, now seen corresponding path program 1 times [2023-12-15 21:50:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119722744] [2023-12-15 21:50:36,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,682 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:50:36,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119722744] [2023-12-15 21:50:36,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119722744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:36,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:36,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:50:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114497047] [2023-12-15 21:50:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:36,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:36,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:36,687 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:50:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:36,758 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2023-12-15 21:50:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:36,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2023-12-15 21:50:36,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:36,763 INFO L225 Difference]: With dead ends: 152 [2023-12-15 21:50:36,763 INFO L226 Difference]: Without dead ends: 86 [2023-12-15 21:50:36,763 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:50:36,764 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:36,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:36,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-15 21:50:36,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2023-12-15 21:50:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 74 states have internal predecessors, (85), 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:50:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2023-12-15 21:50:36,773 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 11 [2023-12-15 21:50:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:36,773 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2023-12-15 21:50:36,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:50:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2023-12-15 21:50:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-15 21:50:36,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:36,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:36,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:50:36,775 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:36,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,775 INFO L85 PathProgramCache]: Analyzing trace with hash -591627506, now seen corresponding path program 1 times [2023-12-15 21:50:36,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923906168] [2023-12-15 21:50:36,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,959 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:50:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923906168] [2023-12-15 21:50:36,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923906168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:36,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:36,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273907212] [2023-12-15 21:50:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:36,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:50:36,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:36,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:50:36,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:36,962 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:37,060 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2023-12-15 21:50:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:50:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-15 21:50:37,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:37,061 INFO L225 Difference]: With dead ends: 90 [2023-12-15 21:50:37,061 INFO L226 Difference]: Without dead ends: 70 [2023-12-15 21:50:37,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:50:37,062 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:37,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 260 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-15 21:50:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-12-15 21:50:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 62 states have (on average 1.2580645161290323) internal successors, (78), 69 states have internal predecessors, (78), 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:50:37,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2023-12-15 21:50:37,069 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 16 [2023-12-15 21:50:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:37,069 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2023-12-15 21:50:37,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2023-12-15 21:50:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 21:50:37,070 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:37,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:37,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:50:37,071 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:37,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:37,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1690121268, now seen corresponding path program 1 times [2023-12-15 21:50:37,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:37,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493185765] [2023-12-15 21:50:37,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:37,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:37,230 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:50:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493185765] [2023-12-15 21:50:37,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493185765] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853512301] [2023-12-15 21:50:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:37,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:37,238 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:50:37,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:50:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:37,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-15 21:50:37,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:37,408 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:50:37,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:37,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:37,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2023-12-15 21:50:37,508 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-12-15 21:50:37,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2023-12-15 21:50:37,529 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:50:37,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:50:37,570 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:50:37,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-15 21:50:37,607 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:50:37,608 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 33 treesize of output 32 [2023-12-15 21:50:37,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-15 21:50:37,720 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:50:37,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:37,833 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-15 21:50:37,834 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 106 treesize of output 113 [2023-12-15 21:50:37,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 167 [2023-12-15 21:50:37,879 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 107 treesize of output 101 [2023-12-15 21:50:38,025 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:50:38,031 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:50:38,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:38,039 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 30 treesize of output 30 [2023-12-15 21:50:38,115 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:50:38,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853512301] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:38,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:38,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-15 21:50:38,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385409557] [2023-12-15 21:50:38,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:38,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-15 21:50:38,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:38,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-15 21:50:38,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=78, Unknown=3, NotChecked=0, Total=110 [2023-12-15 21:50:38,118 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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:50:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:38,325 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2023-12-15 21:50:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:50:38,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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 18 [2023-12-15 21:50:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:38,328 INFO L225 Difference]: With dead ends: 143 [2023-12-15 21:50:38,328 INFO L226 Difference]: Without dead ends: 141 [2023-12-15 21:50:38,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=92, Unknown=3, NotChecked=0, Total=132 [2023-12-15 21:50:38,330 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 203 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:38,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 443 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:50:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-12-15 21:50:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 83. [2023-12-15 21:50:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 75 states have (on average 1.24) internal successors, (93), 82 states have internal predecessors, (93), 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:50:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-12-15 21:50:38,350 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 18 [2023-12-15 21:50:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:38,350 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-12-15 21:50:38,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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:50:38,350 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-12-15 21:50:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 21:50:38,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:38,352 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:38,360 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:50:38,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-15 21:50:38,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:38,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1171861483, now seen corresponding path program 1 times [2023-12-15 21:50:38,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:38,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918957894] [2023-12-15 21:50:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:38,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:38,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918957894] [2023-12-15 21:50:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918957894] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539734140] [2023-12-15 21:50:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:38,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:38,608 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:50:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:38,643 INFO L93 Difference]: Finished difference Result 173 states and 198 transitions. [2023-12-15 21:50:38,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-15 21:50:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:38,644 INFO L225 Difference]: With dead ends: 173 [2023-12-15 21:50:38,644 INFO L226 Difference]: Without dead ends: 107 [2023-12-15 21:50:38,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:50:38,646 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 24 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:38,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 124 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-15 21:50:38,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2023-12-15 21:50:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 88 states have (on average 1.2045454545454546) internal successors, (106), 95 states have internal predecessors, (106), 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:50:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2023-12-15 21:50:38,660 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 19 [2023-12-15 21:50:38,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:38,660 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2023-12-15 21:50:38,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:50:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2023-12-15 21:50:38,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:50:38,662 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:38,663 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:38,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:50:38,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:38,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash -172877468, now seen corresponding path program 1 times [2023-12-15 21:50:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:38,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585595265] [2023-12-15 21:50:38,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:38,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-15 21:50:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:38,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585595265] [2023-12-15 21:50:38,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585595265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:38,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:38,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:38,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829315242] [2023-12-15 21:50:38,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:38,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:38,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:38,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:38,730 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:38,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:38,766 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2023-12-15 21:50:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:38,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-15 21:50:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:38,767 INFO L225 Difference]: With dead ends: 200 [2023-12-15 21:50:38,767 INFO L226 Difference]: Without dead ends: 121 [2023-12-15 21:50:38,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:50:38,770 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 30 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:38,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-15 21:50:38,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2023-12-15 21:50:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 101 states have (on average 1.188118811881188) internal successors, (120), 108 states have internal predecessors, (120), 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:50:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2023-12-15 21:50:38,784 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 26 [2023-12-15 21:50:38,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:38,785 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2023-12-15 21:50:38,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2023-12-15 21:50:38,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-15 21:50:38,787 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:38,787 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:38,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:50:38,788 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:38,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash -746524485, now seen corresponding path program 1 times [2023-12-15 21:50:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266329599] [2023-12-15 21:50:38,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:39,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266329599] [2023-12-15 21:50:39,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266329599] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544427477] [2023-12-15 21:50:39,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:39,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:39,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:39,468 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:50:39,476 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:50:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:39,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-15 21:50:39,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:39,600 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:50:39,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2023-12-15 21:50:39,680 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2023-12-15 21:50:39,681 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 2 case distinctions, treesize of input 93 treesize of output 61 [2023-12-15 21:50:39,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2023-12-15 21:50:39,702 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:50:39,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-12-15 21:50:39,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2023-12-15 21:50:39,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:39,718 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:50:39,750 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:50:39,856 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-12-15 21:50:39,856 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 49 [2023-12-15 21:50:39,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:39,872 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-15 21:50:39,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 64 [2023-12-15 21:50:39,892 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-12-15 21:50:39,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-12-15 21:50:39,907 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2023-12-15 21:50:39,907 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 49 [2023-12-15 21:50:39,917 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2023-12-15 21:50:39,918 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 2 case distinctions, treesize of input 75 treesize of output 47 [2023-12-15 21:50:39,977 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-15 21:50:39,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 56 [2023-12-15 21:50:40,151 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-15 21:50:40,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-12-15 21:50:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:40,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:40,183 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_452 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_452) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-12-15 21:50:40,197 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_25| Int) (v_ArrVal_449 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_25|) 0)) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_25|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_25| v_ArrVal_449))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_452)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) is different from false [2023-12-15 21:50:40,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:40,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-12-15 21:50:40,248 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array Int Int)) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_449))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_452)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))))) is different from false [2023-12-15 21:50:40,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:40,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 67 [2023-12-15 21:50:40,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:40,280 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 18681 treesize of output 14088 [2023-12-15 21:50:40,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:40,548 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 3148 treesize of output 2664 [2023-12-15 21:50:40,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:40,613 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 2646 treesize of output 2473 [2023-12-15 21:50:40,678 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:40,679 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 2464 treesize of output 2357 [2023-12-15 21:50:40,754 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 2348 treesize of output 2318 [2023-12-15 21:50:41,856 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-12-15 21:50:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544427477] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:41,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 17 [2023-12-15 21:50:41,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580562052] [2023-12-15 21:50:41,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:41,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:50:41,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:41,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:50:41,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=172, Unknown=3, NotChecked=84, Total=306 [2023-12-15 21:50:41,858 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 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:50:45,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:50:49,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-15 21:50:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:50,391 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2023-12-15 21:50:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:50:50,391 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 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 27 [2023-12-15 21:50:50,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:50,392 INFO L225 Difference]: With dead ends: 179 [2023-12-15 21:50:50,392 INFO L226 Difference]: Without dead ends: 177 [2023-12-15 21:50:50,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=300, Unknown=3, NotChecked=114, Total=506 [2023-12-15 21:50:50,393 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 235 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 327 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:50,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 742 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 315 Invalid, 2 Unknown, 327 Unchecked, 8.3s Time] [2023-12-15 21:50:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-15 21:50:50,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 125. [2023-12-15 21:50:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 117 states have (on average 1.170940170940171) internal successors, (137), 124 states have internal predecessors, (137), 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:50:50,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2023-12-15 21:50:50,403 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 27 [2023-12-15 21:50:50,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:50,403 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2023-12-15 21:50:50,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 17 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:50:50,403 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2023-12-15 21:50:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:50:50,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:50,405 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, 1, 1] [2023-12-15 21:50:50,413 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:50:50,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-15 21:50:50,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:50,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1798535576, now seen corresponding path program 1 times [2023-12-15 21:50:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:50,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546199612] [2023-12-15 21:50:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:50,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:50,644 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:50:50,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:50,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546199612] [2023-12-15 21:50:50,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546199612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:50,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:50,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:50,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798101960] [2023-12-15 21:50:50,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:50,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:50,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:50,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:50,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:50,646 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:50,663 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2023-12-15 21:50:50,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:50,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 21:50:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:50,665 INFO L225 Difference]: With dead ends: 128 [2023-12-15 21:50:50,665 INFO L226 Difference]: Without dead ends: 126 [2023-12-15 21:50:50,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:50:50,666 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:50,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-15 21:50:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2023-12-15 21:50:50,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 125 states have internal predecessors, (138), 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:50:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2023-12-15 21:50:50,676 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 28 [2023-12-15 21:50:50,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:50,676 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2023-12-15 21:50:50,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2023-12-15 21:50:50,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:50:50,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:50,678 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, 1, 1] [2023-12-15 21:50:50,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:50:50,679 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:50,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:50,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1798533654, now seen corresponding path program 1 times [2023-12-15 21:50:50,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:50,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119185293] [2023-12-15 21:50:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:51,289 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:50:51,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:51,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119185293] [2023-12-15 21:50:51,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119185293] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:51,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619208531] [2023-12-15 21:50:51,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:51,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:51,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:51,291 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:50:51,313 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:50:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:51,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-15 21:50:51,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:51,415 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:50:51,442 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:50:51,442 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:50:51,447 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 35 treesize of output 26 [2023-12-15 21:50:51,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:51,450 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:50:51,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:51,454 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 20 treesize of output 19 [2023-12-15 21:50:51,459 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:50:51,463 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:50:51,465 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:50:51,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:50:51,497 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 79 treesize of output 68 [2023-12-15 21:50:51,503 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:50:51,507 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 27 treesize of output 1 [2023-12-15 21:50:51,631 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:50:51,636 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:50:51,668 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 15 treesize of output 7 [2023-12-15 21:50:51,672 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:50:51,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:51,754 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 72 treesize of output 52 [2023-12-15 21:50:51,761 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_590 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_590) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|)) (forall ((v_ArrVal_589 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-12-15 21:50:51,795 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-12-15 21:50:51,796 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 168 treesize of output 147 [2023-12-15 21:50:51,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:51,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 110 [2023-12-15 21:50:51,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:51,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 298 treesize of output 261 [2023-12-15 21:50:51,843 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 187 treesize of output 181 [2023-12-15 21:50:51,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:51,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 184 [2023-12-15 21:50:51,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:51,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 233 [2023-12-15 21:50:51,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 179 treesize of output 173 [2023-12-15 21:50:51,914 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 237 treesize of output 199 [2023-12-15 21:50:52,563 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:50:52,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619208531] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:52,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:52,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2023-12-15 21:50:52,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987329148] [2023-12-15 21:50:52,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:52,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:50:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:52,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:50:52,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=234, Unknown=1, NotChecked=30, Total=306 [2023-12-15 21:50:52,567 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 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:50:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:53,232 INFO L93 Difference]: Finished difference Result 217 states and 235 transitions. [2023-12-15 21:50:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 21:50:53,233 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 21:50:53,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:53,234 INFO L225 Difference]: With dead ends: 217 [2023-12-15 21:50:53,234 INFO L226 Difference]: Without dead ends: 215 [2023-12-15 21:50:53,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=431, Unknown=1, NotChecked=44, Total=600 [2023-12-15 21:50:53,235 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 258 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:53,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 966 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 476 Invalid, 0 Unknown, 143 Unchecked, 0.4s Time] [2023-12-15 21:50:53,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-15 21:50:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 135. [2023-12-15 21:50:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 127 states have (on average 1.1653543307086613) internal successors, (148), 134 states have internal predecessors, (148), 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:50:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 148 transitions. [2023-12-15 21:50:53,246 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 148 transitions. Word has length 28 [2023-12-15 21:50:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:53,246 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 148 transitions. [2023-12-15 21:50:53,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 17 states have internal predecessors, (78), 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:50:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 148 transitions. [2023-12-15 21:50:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-15 21:50:53,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:53,247 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:53,252 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:50:53,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:53,452 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2023-12-15 21:50:53,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:53,453 INFO L85 PathProgramCache]: Analyzing trace with hash -366206391, now seen corresponding path program 1 times [2023-12-15 21:50:53,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:53,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096107286] [2023-12-15 21:50:53,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:53,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:54,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096107286] [2023-12-15 21:50:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096107286] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80757832] [2023-12-15 21:50:54,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:54,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:54,013 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:50:54,034 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:50:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:54,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-15 21:50:54,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:54,147 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:50:54,181 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 35 treesize of output 26 [2023-12-15 21:50:54,191 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:50:54,191 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 38 treesize of output 35 [2023-12-15 21:50:54,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 5 treesize of output 3 [2023-12-15 21:50:54,215 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-12-15 21:50:54,215 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:50:54,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:54,224 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:50:54,227 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:50:54,235 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:50:54,263 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:50:54,270 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:50:54,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:54,362 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-12-15 21:50:54,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 41 [2023-12-15 21:50:54,373 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:50:54,373 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:50:54,384 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-12-15 21:50:54,384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 31 [2023-12-15 21:50:54,402 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-15 21:50:54,402 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 52 [2023-12-15 21:50:54,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:54,413 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-12-15 21:50:54,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 57 [2023-12-15 21:50:54,422 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:50:54,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-12-15 21:50:54,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:54,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 11 [2023-12-15 21:50:54,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:54,447 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-12-15 21:50:54,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 64 [2023-12-15 21:50:54,499 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-12-15 21:50:54,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 62 [2023-12-15 21:50:54,505 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 32 treesize of output 11 [2023-12-15 21:50:54,667 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:50:54,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-12-15 21:50:54,671 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:50:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:54,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:54,703 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int)) (v_ArrVal_747 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_747))) (select .cse0 (select (select .cse0 |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_~item~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0))) is different from false [2023-12-15 21:50:54,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:54,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 120 [2023-12-15 21:50:54,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:54,891 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 1035 treesize of output 907 [2023-12-15 21:50:54,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:50:55,437 INFO L349 Elim1Store]: treesize reduction 475, result has 32.7 percent of original size [2023-12-15 21:50:55,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 46 case distinctions, treesize of input 538976 treesize of output 376914 [2023-12-15 21:51:00,901 INFO L349 Elim1Store]: treesize reduction 342, result has 58.1 percent of original size [2023-12-15 21:51:00,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 19 new quantified variables, introduced 78 case distinctions, treesize of input 254977 treesize of output 190802 [2023-12-15 21:51:03,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:51:03,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 358158 treesize of output 321440 [2023-12-15 21:51:09,707 WARN L293 SmtUtils]: Spent 6.68s on a formula simplification. DAG size of input: 3727 DAG size of output: 1552 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-15 21:51:10,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:51:10,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 87824 treesize of output 71806 [2023-12-15 21:51:16,799 WARN L293 SmtUtils]: Spent 5.97s on a formula simplification. DAG size of input: 1807 DAG size of output: 1801 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-15 21:51:16,855 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 61560 treesize of output 61296 [2023-12-15 21:51:18,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:51:18,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61450 treesize of output 57198 [2023-12-15 21:51:19,851 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 57076 treesize of output 56820 [2023-12-15 21:51:21,358 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 56834 treesize of output 56074 [2023-12-15 21:51:23,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:51:23,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 56156 treesize of output 54020 Received shutdown request... [2023-12-15 21:51:40,287 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:51:40,288 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-15 21:51:40,294 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (13 of 14 remaining) [2023-12-15 21:51:40,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-15 21:51:40,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:51:40,500 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. [2023-12-15 21:51:40,502 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 14 remaining) [2023-12-15 21:51:40,502 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (11 of 14 remaining) [2023-12-15 21:51:40,502 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (10 of 14 remaining) [2023-12-15 21:51:40,503 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (9 of 14 remaining) [2023-12-15 21:51:40,503 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (8 of 14 remaining) [2023-12-15 21:51:40,503 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 14 remaining) [2023-12-15 21:51:40,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (6 of 14 remaining) [2023-12-15 21:51:40,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (5 of 14 remaining) [2023-12-15 21:51:40,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (4 of 14 remaining) [2023-12-15 21:51:40,505 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (3 of 14 remaining) [2023-12-15 21:51:40,506 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (2 of 14 remaining) [2023-12-15 21:51:40,506 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (1 of 14 remaining) [2023-12-15 21:51:40,506 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (0 of 14 remaining) [2023-12-15 21:51:40,508 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:51:40,511 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:51:40,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:51:40 BoogieIcfgContainer [2023-12-15 21:51:40,513 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:51:40,514 INFO L158 Benchmark]: Toolchain (without parser) took 65987.25ms. Allocated memory was 276.8MB in the beginning and 1.2GB in the end (delta: 960.5MB). Free memory was 224.9MB in the beginning and 707.6MB in the end (delta: -482.7MB). Peak memory consumption was 751.0MB. Max. memory is 8.0GB. [2023-12-15 21:51:40,514 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 178.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:51:40,514 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.78ms. Allocated memory is still 276.8MB. Free memory was 224.4MB in the beginning and 203.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-15 21:51:40,514 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.84ms. Allocated memory is still 276.8MB. Free memory was 203.8MB in the beginning and 201.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:51:40,514 INFO L158 Benchmark]: Boogie Preprocessor took 48.57ms. Allocated memory is still 276.8MB. Free memory was 201.3MB in the beginning and 198.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:51:40,515 INFO L158 Benchmark]: RCFGBuilder took 406.43ms. Allocated memory is still 276.8MB. Free memory was 198.1MB in the beginning and 177.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-15 21:51:40,515 INFO L158 Benchmark]: TraceAbstraction took 64995.65ms. Allocated memory was 276.8MB in the beginning and 1.2GB in the end (delta: 960.5MB). Free memory was 176.1MB in the beginning and 707.6MB in the end (delta: -531.5MB). Peak memory consumption was 702.8MB. Max. memory is 8.0GB. [2023-12-15 21:51:40,518 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.11ms. Allocated memory is still 178.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 464.78ms. Allocated memory is still 276.8MB. Free memory was 224.4MB in the beginning and 203.8MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.84ms. Allocated memory is still 276.8MB. Free memory was 203.8MB in the beginning and 201.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.57ms. Allocated memory is still 276.8MB. Free memory was 201.3MB in the beginning and 198.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.43ms. Allocated memory is still 276.8MB. Free memory was 198.1MB in the beginning and 177.2MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 64995.65ms. Allocated memory was 276.8MB in the beginning and 1.2GB in the end (delta: 960.5MB). Free memory was 176.1MB in the beginning and 707.6MB in the end (delta: -531.5MB). Peak memory consumption was 702.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: 1041]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1041). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1027]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1027). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1028]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1028). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1031]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1031). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1034). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1035]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1035). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1039]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1039). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1040]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1040). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1045]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1045). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1046]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1046). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1047]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1047). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1048). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 1049). Cancelled while NwaCegarLoop was analyzing trace of length 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-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 31 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-3-2-3-2-3-3-5-3-5-3-3-3-3-3-3-3-3-3-3-2-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-123-3-8-5-6-3-5-4-5-5-4-3-3-3-3-3-3-3-3-3-2-3-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 82 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 64.9s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1007 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1007 mSDsluCounter, 3223 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 470 IncrementalHoareTripleChecker+Unchecked, 2457 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1138 IncrementalHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 766 mSDtfsCounter, 1138 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135occurred in iteration=11, InterpolantAutomatonStates: 57, 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, 11 MinimizatonAttempts, 273 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 319 ConstructedInterpolants, 32 QuantifiedInterpolants, 4756 SizeOfPredicates, 25 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 15/60 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