/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-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:50:29,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:50:29,353 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:29,356 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:50:29,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:50:29,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:50:29,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:50:29,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:50:29,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:50:29,372 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:50:29,372 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:50:29,372 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:50:29,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:50:29,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:50:29,373 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:50:29,373 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:50:29,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:50:29,374 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:50:29,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:50:29,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:50:29,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:50:29,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:50:29,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:50:29,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:50:29,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:50:29,376 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:50:29,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:50:29,376 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:50:29,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:50:29,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:50:29,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:50:29,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:50:29,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:29,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:50:29,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:50:29,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:50:29,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:50:29,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:50:29,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:50:29,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:50:29,378 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:50:29,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:50:29,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:50:29,379 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:29,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:50:29,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:50:29,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:50:29,625 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:50:29,625 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:50:29,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2023-12-15 21:50:30,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:50:30,762 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:50:30,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2023-12-15 21:50:30,776 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4199cc8a0/6e8f8b11761849559b539f2bf192ba24/FLAG6a33963e7 [2023-12-15 21:50:30,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4199cc8a0/6e8f8b11761849559b539f2bf192ba24 [2023-12-15 21:50:30,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:50:30,792 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:50:30,794 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:30,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:50:30,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:50:30,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:30" (1/1) ... [2023-12-15 21:50:30,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34adf47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:30, skipping insertion in model container [2023-12-15 21:50:30,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:50:30" (1/1) ... [2023-12-15 21:50:30,839 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:50:31,040 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-01-2.i[22080,22093] [2023-12-15 21:50:31,049 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-01-2.i[22353,22366] [2023-12-15 21:50:31,051 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-01-2.i[22587,22600] [2023-12-15 21:50:31,052 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-01-2.i[22657,22670] [2023-12-15 21:50:31,055 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-01-2.i[22924,22937] [2023-12-15 21:50:31,056 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-01-2.i[23032,23045] [2023-12-15 21:50:31,058 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-01-2.i[23263,23276] [2023-12-15 21:50:31,060 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-01-2.i[23343,23356] [2023-12-15 21:50:31,061 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-01-2.i[23422,23435] [2023-12-15 21:50:31,061 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-01-2.i[23512,23525] [2023-12-15 21:50:31,064 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-01-2.i[23690,23703] [2023-12-15 21:50:31,064 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-01-2.i[23768,23781] [2023-12-15 21:50:31,065 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-01-2.i[23845,23858] [2023-12-15 21:50:31,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:31,077 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:50:31,104 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-01-2.i[22080,22093] [2023-12-15 21:50:31,106 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-01-2.i[22353,22366] [2023-12-15 21:50:31,107 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-01-2.i[22587,22600] [2023-12-15 21:50:31,107 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-01-2.i[22657,22670] [2023-12-15 21:50:31,113 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-01-2.i[22924,22937] [2023-12-15 21:50:31,113 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-01-2.i[23032,23045] [2023-12-15 21:50:31,114 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-01-2.i[23263,23276] [2023-12-15 21:50:31,115 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-01-2.i[23343,23356] [2023-12-15 21:50:31,115 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-01-2.i[23422,23435] [2023-12-15 21:50:31,116 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-01-2.i[23512,23525] [2023-12-15 21:50:31,117 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-01-2.i[23690,23703] [2023-12-15 21:50:31,117 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-01-2.i[23768,23781] [2023-12-15 21:50:31,118 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-01-2.i[23845,23858] [2023-12-15 21:50:31,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:50:31,138 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:50:31,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:31 WrapperNode [2023-12-15 21:50:31,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:50:31,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:31,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:50:31,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:50:31,146 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:31" (1/1) ... [2023-12-15 21:50:31,167 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:31" (1/1) ... [2023-12-15 21:50:31,189 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 228 [2023-12-15 21:50:31,189 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:50:31,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:50:31,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:50:31,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:50:31,197 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:31" (1/1) ... [2023-12-15 21:50:31,197 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:31" (1/1) ... [2023-12-15 21:50:31,200 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:31" (1/1) ... [2023-12-15 21:50:31,218 INFO L175 MemorySlicer]: Split 35 memory accesses to 2 slices as follows [2, 33]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 14 writes are split as follows [0, 14]. [2023-12-15 21:50:31,218 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:31" (1/1) ... [2023-12-15 21:50:31,218 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:31" (1/1) ... [2023-12-15 21:50:31,223 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:31" (1/1) ... [2023-12-15 21:50:31,227 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:31" (1/1) ... [2023-12-15 21:50:31,228 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:31" (1/1) ... [2023-12-15 21:50:31,229 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:31" (1/1) ... [2023-12-15 21:50:31,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:50:31,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:50:31,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:50:31,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:50:31,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:31" (1/1) ... [2023-12-15 21:50:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:50:31,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:31,263 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:31,267 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:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:50:31,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:50:31,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:50:31,362 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:50:31,364 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:50:31,652 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:50:31,671 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:50:31,672 INFO L309 CfgBuilder]: Removed 30 assume(true) statements. [2023-12-15 21:50:31,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:31 BoogieIcfgContainer [2023-12-15 21:50:31,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:50:31,673 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:50:31,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:50:31,676 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:50:31,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:50:30" (1/3) ... [2023-12-15 21:50:31,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382cef00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:31, skipping insertion in model container [2023-12-15 21:50:31,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:50:31" (2/3) ... [2023-12-15 21:50:31,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382cef00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:50:31, skipping insertion in model container [2023-12-15 21:50:31,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:50:31" (3/3) ... [2023-12-15 21:50:31,678 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2023-12-15 21:50:31,707 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:50:31,708 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2023-12-15 21:50:31,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:50:31,748 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;@3c60d245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:50:31,748 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-12-15 21:50:31,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 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:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-15 21:50:31,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:31,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-15 21:50:31,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:31,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash 348139, now seen corresponding path program 1 times [2023-12-15 21:50:31,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:31,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998578319] [2023-12-15 21:50:31,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:31,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:31,925 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:31,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:31,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998578319] [2023-12-15 21:50:31,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998578319] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:31,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:31,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:50:31,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426522078] [2023-12-15 21:50:31,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:31,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:31,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:31,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:31,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:31,956 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 2.0) internal successors, (132), 79 states have internal predecessors, (132), 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 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:32,033 INFO L93 Difference]: Finished difference Result 175 states and 291 transitions. [2023-12-15 21:50:32,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:32,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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 3 [2023-12-15 21:50:32,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:32,042 INFO L225 Difference]: With dead ends: 175 [2023-12-15 21:50:32,042 INFO L226 Difference]: Without dead ends: 94 [2023-12-15 21:50:32,044 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:32,048 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 83 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:32,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 91 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-15 21:50:32,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2023-12-15 21:50:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.328125) internal successors, (85), 75 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:32,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-12-15 21:50:32,079 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 3 [2023-12-15 21:50:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:32,079 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-12-15 21:50:32,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-12-15 21:50:32,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:50:32,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:32,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:32,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:50:32,080 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:32,081 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:32,081 INFO L85 PathProgramCache]: Analyzing trace with hash -85138699, now seen corresponding path program 1 times [2023-12-15 21:50:32,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:32,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684699814] [2023-12-15 21:50:32,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:32,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:32,219 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:32,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:32,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684699814] [2023-12-15 21:50:32,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684699814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:32,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:32,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:32,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283656800] [2023-12-15 21:50:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:32,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:32,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:32,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:32,222 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:32,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:32,318 INFO L93 Difference]: Finished difference Result 200 states and 222 transitions. [2023-12-15 21:50:32,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:50:32,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 21:50:32,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:32,320 INFO L225 Difference]: With dead ends: 200 [2023-12-15 21:50:32,320 INFO L226 Difference]: Without dead ends: 131 [2023-12-15 21:50:32,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32,321 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 57 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:32,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 197 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:32,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-15 21:50:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 78. [2023-12-15 21:50:32,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 77 states have internal predecessors, (87), 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:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2023-12-15 21:50:32,332 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 9 [2023-12-15 21:50:32,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:32,332 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2023-12-15 21:50:32,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:32,332 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2023-12-15 21:50:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:50:32,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:32,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:32,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:50:32,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:32,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash -85136777, now seen corresponding path program 1 times [2023-12-15 21:50:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:32,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882797347] [2023-12-15 21:50:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:32,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:32,437 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:32,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882797347] [2023-12-15 21:50:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882797347] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:32,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256937637] [2023-12-15 21:50:32,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:32,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:32,439 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:32,545 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2023-12-15 21:50:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:50:32,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 21:50:32,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:32,549 INFO L225 Difference]: With dead ends: 132 [2023-12-15 21:50:32,549 INFO L226 Difference]: Without dead ends: 130 [2023-12-15 21:50:32,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:32,550 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:32,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-15 21:50:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 79. [2023-12-15 21:50:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.3134328358208955) 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:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2023-12-15 21:50:32,558 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 9 [2023-12-15 21:50:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:32,558 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2023-12-15 21:50:32,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:32,559 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2023-12-15 21:50:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-15 21:50:32,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:32,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:32,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:50:32,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:32,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:32,560 INFO L85 PathProgramCache]: Analyzing trace with hash -83289735, now seen corresponding path program 1 times [2023-12-15 21:50:32,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:32,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23476903] [2023-12-15 21:50:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:32,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:32,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23476903] [2023-12-15 21:50:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23476903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:32,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476482949] [2023-12-15 21:50:32,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:32,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:32,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:32,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:32,684 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:32,735 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2023-12-15 21:50:32,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:50:32,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-15 21:50:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:32,736 INFO L225 Difference]: With dead ends: 80 [2023-12-15 21:50:32,736 INFO L226 Difference]: Without dead ends: 78 [2023-12-15 21:50:32,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:32,739 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:32,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 138 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:32,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-15 21:50:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2023-12-15 21:50:32,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 75 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:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-12-15 21:50:32,745 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 9 [2023-12-15 21:50:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:32,745 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-12-15 21:50:32,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-12-15 21:50:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-15 21:50:32,745 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:32,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:32,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:50:32,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:32,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash -198671904, now seen corresponding path program 1 times [2023-12-15 21:50:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:32,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544353107] [2023-12-15 21:50:32,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:32,899 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:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544353107] [2023-12-15 21:50:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544353107] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844019544] [2023-12-15 21:50:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:32,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:50:32,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:32,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:50:32,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:32,901 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:32,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:32,989 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2023-12-15 21:50:32,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:50:32,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-15 21:50:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:32,990 INFO L225 Difference]: With dead ends: 121 [2023-12-15 21:50:32,990 INFO L226 Difference]: Without dead ends: 117 [2023-12-15 21:50:32,990 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:32,991 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 151 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:32,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 154 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:32,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-15 21:50:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2023-12-15 21:50:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 71 states have internal predecessors, (81), 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:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-12-15 21:50:33,006 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 14 [2023-12-15 21:50:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:33,006 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-12-15 21:50:33,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:33,007 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-12-15 21:50:33,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-15 21:50:33,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:33,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:33,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:50:33,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:33,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:33,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1863857528, now seen corresponding path program 1 times [2023-12-15 21:50:33,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:33,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430626437] [2023-12-15 21:50:33,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:33,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:33,067 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:33,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:33,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430626437] [2023-12-15 21:50:33,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430626437] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:33,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:33,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62923030] [2023-12-15 21:50:33,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:33,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:33,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:33,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:33,069 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:33,124 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-12-15 21:50:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:50:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2023-12-15 21:50:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:33,125 INFO L225 Difference]: With dead ends: 131 [2023-12-15 21:50:33,125 INFO L226 Difference]: Without dead ends: 111 [2023-12-15 21:50:33,126 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:33,129 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 131 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 110 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.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:33,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 110 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-15 21:50:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 71. [2023-12-15 21:50:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 70 states have internal predecessors, (80), 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:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2023-12-15 21:50:33,143 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 15 [2023-12-15 21:50:33,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:33,144 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2023-12-15 21:50:33,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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:33,144 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2023-12-15 21:50:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-15 21:50:33,144 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:33,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:33,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:50:33,145 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:33,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash -219174669, now seen corresponding path program 1 times [2023-12-15 21:50:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244046768] [2023-12-15 21:50:33,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:33,184 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:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:33,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244046768] [2023-12-15 21:50:33,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244046768] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444893620] [2023-12-15 21:50:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:33,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:33,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:33,187 INFO L87 Difference]: Start difference. First operand 71 states and 80 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:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:33,198 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2023-12-15 21:50:33,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:33,199 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:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:33,199 INFO L225 Difference]: With dead ends: 117 [2023-12-15 21:50:33,199 INFO L226 Difference]: Without dead ends: 76 [2023-12-15 21:50:33,200 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:33,200 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 3 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:33,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-15 21:50:33,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2023-12-15 21:50:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 73 states have internal predecessors, (84), 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:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2023-12-15 21:50:33,208 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 19 [2023-12-15 21:50:33,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:33,209 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2023-12-15 21:50:33,209 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:33,209 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2023-12-15 21:50:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-15 21:50:33,210 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:33,210 INFO L195 NwaCegarLoop]: trace histogram [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:33,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:50:33,210 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:33,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1795515351, now seen corresponding path program 1 times [2023-12-15 21:50:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208977393] [2023-12-15 21:50:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:33,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:33,241 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:33,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:33,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208977393] [2023-12-15 21:50:33,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208977393] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:33,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097506933] [2023-12-15 21:50:33,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:33,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:33,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:33,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:33,243 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:33,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:33,256 INFO L93 Difference]: Finished difference Result 74 states and 84 transitions. [2023-12-15 21:50:33,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-12-15 21:50:33,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:33,257 INFO L225 Difference]: With dead ends: 74 [2023-12-15 21:50:33,257 INFO L226 Difference]: Without dead ends: 72 [2023-12-15 21:50:33,257 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:33,258 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 13 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:33,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 125 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:33,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-15 21:50:33,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2023-12-15 21:50:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 71 states have internal predecessors, (82), 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:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-12-15 21:50:33,264 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 20 [2023-12-15 21:50:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:33,264 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-12-15 21:50:33,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:33,264 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-12-15 21:50:33,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-15 21:50:33,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:33,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:33,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:50:33,269 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:33,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1692801264, now seen corresponding path program 1 times [2023-12-15 21:50:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731491440] [2023-12-15 21:50:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:33,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:33,364 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:33,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:33,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731491440] [2023-12-15 21:50:33,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731491440] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:33,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:33,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:33,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444592496] [2023-12-15 21:50:33,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:33,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:33,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:33,365 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:33,408 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2023-12-15 21:50:33,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:50:33,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-12-15 21:50:33,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:33,409 INFO L225 Difference]: With dead ends: 73 [2023-12-15 21:50:33,409 INFO L226 Difference]: Without dead ends: 71 [2023-12-15 21:50:33,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:33,409 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:33,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:33,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-15 21:50:33,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2023-12-15 21:50:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.25) internal successors, (80), 69 states have internal predecessors, (80), 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:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2023-12-15 21:50:33,414 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 22 [2023-12-15 21:50:33,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:33,414 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2023-12-15 21:50:33,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2023-12-15 21:50:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 21:50:33,415 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:33,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:33,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:50:33,415 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:33,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:33,415 INFO L85 PathProgramCache]: Analyzing trace with hash 679211624, now seen corresponding path program 1 times [2023-12-15 21:50:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:33,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767494007] [2023-12-15 21:50:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:33,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:33,505 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:33,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:33,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767494007] [2023-12-15 21:50:33,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767494007] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:33,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:33,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:50:33,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687853583] [2023-12-15 21:50:33,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:33,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:50:33,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:33,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:50:33,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:33,508 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:33,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:33,640 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2023-12-15 21:50:33,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:50:33,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 23 [2023-12-15 21:50:33,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:33,641 INFO L225 Difference]: With dead ends: 174 [2023-12-15 21:50:33,641 INFO L226 Difference]: Without dead ends: 132 [2023-12-15 21:50:33,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:50:33,645 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 69 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:33,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 242 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:33,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-12-15 21:50:33,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2023-12-15 21:50:33,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 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:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2023-12-15 21:50:33,652 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 23 [2023-12-15 21:50:33,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:33,653 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2023-12-15 21:50:33,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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:33,654 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2023-12-15 21:50:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-15 21:50:33,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:33,656 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:33,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:50:33,656 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:33,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:33,657 INFO L85 PathProgramCache]: Analyzing trace with hash 578615784, now seen corresponding path program 1 times [2023-12-15 21:50:33,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:33,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346223098] [2023-12-15 21:50:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:33,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:34,161 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:34,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:34,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346223098] [2023-12-15 21:50:34,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346223098] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:34,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:34,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:50:34,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48042071] [2023-12-15 21:50:34,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:34,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:50:34,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:50:34,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:50:34,162 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:34,451 INFO L93 Difference]: Finished difference Result 184 states and 205 transitions. [2023-12-15 21:50:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:50:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2023-12-15 21:50:34,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:34,453 INFO L225 Difference]: With dead ends: 184 [2023-12-15 21:50:34,453 INFO L226 Difference]: Without dead ends: 182 [2023-12-15 21:50:34,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:50:34,454 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 197 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:34,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 385 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:50:34,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-15 21:50:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 92. [2023-12-15 21:50:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 91 states have internal predecessors, (105), 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:34,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-12-15 21:50:34,468 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 23 [2023-12-15 21:50:34,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:34,468 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-12-15 21:50:34,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 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:34,468 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-12-15 21:50:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 21:50:34,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:34,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:34,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:50:34,470 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:34,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:34,470 INFO L85 PathProgramCache]: Analyzing trace with hash -751953218, now seen corresponding path program 1 times [2023-12-15 21:50:34,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:34,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308977691] [2023-12-15 21:50:34,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:34,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:50:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308977691] [2023-12-15 21:50:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308977691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:34,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:34,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:50:34,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034793634] [2023-12-15 21:50:34,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:50:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:50:34,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:50:34,534 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:34,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:34,619 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2023-12-15 21:50:34,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:50:34,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2023-12-15 21:50:34,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:34,621 INFO L225 Difference]: With dead ends: 139 [2023-12-15 21:50:34,621 INFO L226 Difference]: Without dead ends: 121 [2023-12-15 21:50:34,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:34,622 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 22 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:34,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 185 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-15 21:50:34,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2023-12-15 21:50:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 106 states have (on average 1.2452830188679245) internal successors, (132), 111 states have internal predecessors, (132), 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:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2023-12-15 21:50:34,638 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 25 [2023-12-15 21:50:34,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:34,638 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2023-12-15 21:50:34,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:34,638 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2023-12-15 21:50:34,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-15 21:50:34,640 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:34,640 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:34,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:50:34,641 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:34,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:34,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1359692350, now seen corresponding path program 1 times [2023-12-15 21:50:34,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:34,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34415198] [2023-12-15 21:50:34,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:34,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:50:34,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:34,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34415198] [2023-12-15 21:50:34,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34415198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:34,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:34,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:34,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111092311] [2023-12-15 21:50:34,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:34,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:34,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:34,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:34,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:34,676 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:34,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:34,718 INFO L93 Difference]: Finished difference Result 113 states and 133 transitions. [2023-12-15 21:50:34,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:34,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2023-12-15 21:50:34,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:34,719 INFO L225 Difference]: With dead ends: 113 [2023-12-15 21:50:34,719 INFO L226 Difference]: Without dead ends: 111 [2023-12-15 21:50:34,719 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:34,720 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:34,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 74 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-15 21:50:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2023-12-15 21:50:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2380952380952381) internal successors, (130), 109 states have internal predecessors, (130), 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:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2023-12-15 21:50:34,733 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 25 [2023-12-15 21:50:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:34,734 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2023-12-15 21:50:34,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2023-12-15 21:50:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-15 21:50:34,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:34,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:34,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:50:34,734 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:34,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:34,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1843174537, now seen corresponding path program 1 times [2023-12-15 21:50:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:34,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572019475] [2023-12-15 21:50:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:35,067 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,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:35,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572019475] [2023-12-15 21:50:35,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572019475] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:50:35,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112101614] [2023-12-15 21:50:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:35,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:50:35,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:35,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:50:35,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:50:35,069 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:35,324 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2023-12-15 21:50:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:50:35,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:35,326 INFO L225 Difference]: With dead ends: 196 [2023-12-15 21:50:35,326 INFO L226 Difference]: Without dead ends: 194 [2023-12-15 21:50:35,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:50:35,326 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 195 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:35,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 340 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:50:35,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-15 21:50:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 113. [2023-12-15 21:50:35,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 112 states have internal predecessors, (133), 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,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2023-12-15 21:50:35,340 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 26 [2023-12-15 21:50:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:35,341 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2023-12-15 21:50:35,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 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,341 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2023-12-15 21:50:35,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:50:35,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:35,342 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:35,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:50:35,343 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:35,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:35,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1835173535, now seen corresponding path program 1 times [2023-12-15 21:50:35,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:35,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233989280] [2023-12-15 21:50:35,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:35,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:35,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233989280] [2023-12-15 21:50:35,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233989280] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:35,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287168516] [2023-12-15 21:50:35,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:35,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:35,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:35,438 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:35,460 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:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:35,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-15 21:50:35,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:35,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-12-15 21:50:35,573 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 14 treesize of output 15 [2023-12-15 21:50:35,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-15 21:50:35,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-12-15 21:50:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:35,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:35,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:35,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287168516] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:35,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:35,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 7 [2023-12-15 21:50:35,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747933468] [2023-12-15 21:50:35,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:35,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:50:35,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:35,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:50:35,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:50:35,858 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:36,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:36,023 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2023-12-15 21:50:36,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:50:36,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-15 21:50:36,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:36,023 INFO L225 Difference]: With dead ends: 200 [2023-12-15 21:50:36,024 INFO L226 Difference]: Without dead ends: 140 [2023-12-15 21:50:36,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:50:36,024 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 139 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:36,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 210 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:36,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-15 21:50:36,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2023-12-15 21:50:36,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.209090909090909) internal successors, (133), 114 states have internal predecessors, (133), 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,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2023-12-15 21:50:36,040 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 28 [2023-12-15 21:50:36,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:36,040 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2023-12-15 21:50:36,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2023-12-15 21:50:36,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-15 21:50:36,040 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:36,040 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:36,050 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:36,247 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,SelfDestructingSolverStorable14 [2023-12-15 21:50:36,250 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:36,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,250 INFO L85 PathProgramCache]: Analyzing trace with hash 762414011, now seen corresponding path program 1 times [2023-12-15 21:50:36,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333917452] [2023-12-15 21:50:36,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:50:36,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333917452] [2023-12-15 21:50:36,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333917452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:36,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:36,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:50:36,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476819049] [2023-12-15 21:50:36,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:36,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:50:36,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:36,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:50:36,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:50:36,559 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:36,750 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2023-12-15 21:50:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:50:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:36,751 INFO L225 Difference]: With dead ends: 161 [2023-12-15 21:50:36,751 INFO L226 Difference]: Without dead ends: 159 [2023-12-15 21:50:36,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:50:36,751 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 144 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:36,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 254 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:36,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-12-15 21:50:36,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2023-12-15 21:50:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.206896551724138) internal successors, (140), 120 states have internal predecessors, (140), 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,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2023-12-15 21:50:36,767 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 28 [2023-12-15 21:50:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:36,768 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2023-12-15 21:50:36,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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,768 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2023-12-15 21:50:36,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-15 21:50:36,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:36,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:36,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 21:50:36,769 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:36,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,769 INFO L85 PathProgramCache]: Analyzing trace with hash -984027121, now seen corresponding path program 1 times [2023-12-15 21:50:36,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543084638] [2023-12-15 21:50:36,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:36,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543084638] [2023-12-15 21:50:36,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543084638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:36,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:36,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:50:36,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527161442] [2023-12-15 21:50:36,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:36,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:50:36,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:36,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:50:36,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:50:36,806 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:36,833 INFO L93 Difference]: Finished difference Result 214 states and 252 transitions. [2023-12-15 21:50:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:50:36,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2023-12-15 21:50:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:36,834 INFO L225 Difference]: With dead ends: 214 [2023-12-15 21:50:36,834 INFO L226 Difference]: Without dead ends: 153 [2023-12-15 21:50:36,835 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:36,835 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:36,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-12-15 21:50:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 143. [2023-12-15 21:50:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.2173913043478262) internal successors, (168), 142 states have internal predecessors, (168), 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,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 168 transitions. [2023-12-15 21:50:36,854 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 168 transitions. Word has length 30 [2023-12-15 21:50:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:36,854 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 168 transitions. [2023-12-15 21:50:36,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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,854 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 168 transitions. [2023-12-15 21:50:36,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:50:36,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:36,854 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, 1, 1, 1] [2023-12-15 21:50:36,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:50:36,854 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:36,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash 536850794, now seen corresponding path program 1 times [2023-12-15 21:50:36,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:36,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041877447] [2023-12-15 21:50:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:36,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:36,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041877447] [2023-12-15 21:50:36,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041877447] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:36,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819250124] [2023-12-15 21:50:36,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:36,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:36,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:36,936 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:36,966 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:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:37,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-15 21:50:37,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:37,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2023-12-15 21:50:37,054 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 16 treesize of output 17 [2023-12-15 21:50:37,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:37,094 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2023-12-15 21:50:37,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-15 21:50:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:50:37,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:50:37,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819250124] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:37,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:37,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 3] total 8 [2023-12-15 21:50:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898896511] [2023-12-15 21:50:37,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:37,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:50:37,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:50:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:50:37,269 INFO L87 Difference]: Start difference. First operand 143 states and 168 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:37,525 INFO L93 Difference]: Finished difference Result 262 states and 299 transitions. [2023-12-15 21:50:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 21:50:37,525 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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) Word has length 31 [2023-12-15 21:50:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:37,526 INFO L225 Difference]: With dead ends: 262 [2023-12-15 21:50:37,526 INFO L226 Difference]: Without dead ends: 226 [2023-12-15 21:50:37,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-15 21:50:37,527 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 165 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:37,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 291 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:50:37,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-15 21:50:37,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 170. [2023-12-15 21:50:37,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.2363636363636363) internal successors, (204), 169 states have internal predecessors, (204), 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,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 204 transitions. [2023-12-15 21:50:37,557 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 204 transitions. Word has length 31 [2023-12-15 21:50:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:37,557 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 204 transitions. [2023-12-15 21:50:37,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 204 transitions. [2023-12-15 21:50:37,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-15 21:50:37,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:37,558 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:37,580 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:37,767 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,SelfDestructingSolverStorable17 [2023-12-15 21:50:37,767 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:37,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:37,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1292942064, now seen corresponding path program 1 times [2023-12-15 21:50:37,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:37,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720542308] [2023-12-15 21:50:37,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:37,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 21:50:38,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:38,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720542308] [2023-12-15 21:50:38,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720542308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:38,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:38,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:50:38,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228853333] [2023-12-15 21:50:38,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:38,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:50:38,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:50:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:50:38,034 INFO L87 Difference]: Start difference. First operand 170 states and 204 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:38,232 INFO L93 Difference]: Finished difference Result 197 states and 228 transitions. [2023-12-15 21:50:38,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:50:38,232 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-15 21:50:38,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:38,233 INFO L225 Difference]: With dead ends: 197 [2023-12-15 21:50:38,233 INFO L226 Difference]: Without dead ends: 182 [2023-12-15 21:50:38,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-15 21:50:38,234 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 138 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:38,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 194 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:50:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-15 21:50:38,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 160. [2023-12-15 21:50:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.232258064516129) internal successors, (191), 159 states have internal predecessors, (191), 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,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 191 transitions. [2023-12-15 21:50:38,255 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 191 transitions. Word has length 31 [2023-12-15 21:50:38,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:38,255 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 191 transitions. [2023-12-15 21:50:38,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:38,255 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 191 transitions. [2023-12-15 21:50:38,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-15 21:50:38,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:38,256 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:38,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:50:38,256 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:38,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1948386110, now seen corresponding path program 1 times [2023-12-15 21:50:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:38,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880828751] [2023-12-15 21:50:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:38,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 21:50:38,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:38,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880828751] [2023-12-15 21:50:38,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880828751] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:50:38,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:50:38,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:50:38,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904493028] [2023-12-15 21:50:38,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:50:38,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:50:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:38,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:50:38,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:38,303 INFO L87 Difference]: Start difference. First operand 160 states and 191 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:38,364 INFO L93 Difference]: Finished difference Result 222 states and 262 transitions. [2023-12-15 21:50:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:50:38,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-15 21:50:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:38,365 INFO L225 Difference]: With dead ends: 222 [2023-12-15 21:50:38,365 INFO L226 Difference]: Without dead ends: 96 [2023-12-15 21:50:38,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:50:38,365 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:38,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 199 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:50:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-15 21:50:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2023-12-15 21:50:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.1954022988505748) internal successors, (104), 90 states have internal predecessors, (104), 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,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2023-12-15 21:50:38,375 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 34 [2023-12-15 21:50:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:38,375 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2023-12-15 21:50:38,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 21:50:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2023-12-15 21:50:38,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 21:50:38,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:38,376 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:38,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 21:50:38,376 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:38,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:38,376 INFO L85 PathProgramCache]: Analyzing trace with hash -364254705, now seen corresponding path program 1 times [2023-12-15 21:50:38,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:38,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535041962] [2023-12-15 21:50:38,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:38,594 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,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535041962] [2023-12-15 21:50:38,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535041962] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:38,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220989357] [2023-12-15 21:50:38,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:38,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:38,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:38,596 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:38,616 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:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:38,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-15 21:50:38,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:38,702 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:38,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:50:38,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-15 21:50:38,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:38,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-15 21:50:38,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:38,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:38,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-12-15 21:50:38,802 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:50:38,803 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 23 treesize of output 20 [2023-12-15 21:50:38,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:38,817 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:38,861 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-15 21:50:38,861 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:38,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-15 21:50:38,877 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:38,883 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-15 21:50:38,972 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-15 21:50:38,972 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 48 treesize of output 43 [2023-12-15 21:50:38,977 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:39,101 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:39,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:50:43,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:50:43,436 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:50:43,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:43,440 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 2 case distinctions, treesize of input 50 treesize of output 55 [2023-12-15 21:50:43,444 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:50:43,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-15 21:50:43,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 73 [2023-12-15 21:50:43,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2023-12-15 21:50:43,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-15 21:50:43,485 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-12-15 21:50:43,486 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 2 case distinctions, treesize of input 66 treesize of output 1 [2023-12-15 21:50:43,511 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:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220989357] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:50:43,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:50:43,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-12-15 21:50:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730208927] [2023-12-15 21:50:43,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:50:43,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 21:50:43,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:50:43,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 21:50:43,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=229, Unknown=9, NotChecked=0, Total=306 [2023-12-15 21:50:43,513 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 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:47,545 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:52,505 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:52,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:50:52,516 INFO L93 Difference]: Finished difference Result 274 states and 313 transitions. [2023-12-15 21:50:52,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-15 21:50:52,516 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 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 35 [2023-12-15 21:50:52,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:50:52,517 INFO L225 Difference]: With dead ends: 274 [2023-12-15 21:50:52,517 INFO L226 Difference]: Without dead ends: 214 [2023-12-15 21:50:52,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=230, Invalid=629, Unknown=11, NotChecked=0, Total=870 [2023-12-15 21:50:52,518 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 440 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 68 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-15 21:50:52,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 695 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 422 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2023-12-15 21:50:52,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-15 21:50:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 112. [2023-12-15 21:50:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 108 states have (on average 1.1851851851851851) internal successors, (128), 111 states have internal predecessors, (128), 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:52,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2023-12-15 21:50:52,532 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 35 [2023-12-15 21:50:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:50:52,532 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2023-12-15 21:50:52,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 17 states have internal predecessors, (79), 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:52,533 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2023-12-15 21:50:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-15 21:50:52,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:50:52,533 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:50:52,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-15 21:50:52,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:52,738 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-12-15 21:50:52,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:50:52,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1048858225, now seen corresponding path program 1 times [2023-12-15 21:50:52,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:50:52,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121518259] [2023-12-15 21:50:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:50:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:53,490 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:53,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:50:53,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121518259] [2023-12-15 21:50:53,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121518259] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:50:53,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861306164] [2023-12-15 21:50:53,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:50:53,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:53,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:50:53,492 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:53,496 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:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:50:53,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-15 21:50:53,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:50:53,640 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:53,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:53,663 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 185 treesize of output 152 [2023-12-15 21:50:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:53,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:53,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 105 [2023-12-15 21:50:53,704 INFO L349 Elim1Store]: treesize reduction 75, result has 18.5 percent of original size [2023-12-15 21:50:53,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 198 treesize of output 198 [2023-12-15 21:50:53,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:53,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-15 21:50:53,750 INFO L349 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-12-15 21:50:53,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 112 [2023-12-15 21:50:53,769 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 133 treesize of output 115 [2023-12-15 21:50:53,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 34 [2023-12-15 21:50:53,798 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-12-15 21:50:53,798 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 25 treesize of output 29 [2023-12-15 21:50:53,845 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-15 21:50:53,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-15 21:50:54,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:50:54,054 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-12-15 21:50:54,057 INFO L158 Benchmark]: Toolchain (without parser) took 23265.17ms. Allocated memory was 308.3MB in the beginning and 588.3MB in the end (delta: 280.0MB). Free memory was 254.8MB in the beginning and 317.3MB in the end (delta: -62.5MB). Peak memory consumption was 218.5MB. Max. memory is 8.0GB. [2023-12-15 21:50:54,057 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:50:54,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.46ms. Allocated memory is still 308.3MB. Free memory was 254.5MB in the beginning and 233.8MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-15 21:50:54,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.93ms. Allocated memory is still 308.3MB. Free memory was 233.5MB in the beginning and 231.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:50:54,057 INFO L158 Benchmark]: Boogie Preprocessor took 45.53ms. Allocated memory is still 308.3MB. Free memory was 231.1MB in the beginning and 228.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-15 21:50:54,057 INFO L158 Benchmark]: RCFGBuilder took 436.36ms. Allocated memory is still 308.3MB. Free memory was 228.0MB in the beginning and 264.8MB in the end (delta: -36.9MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. [2023-12-15 21:50:54,058 INFO L158 Benchmark]: TraceAbstraction took 22382.87ms. Allocated memory was 308.3MB in the beginning and 588.3MB in the end (delta: 280.0MB). Free memory was 264.3MB in the beginning and 317.3MB in the end (delta: -53.0MB). Peak memory consumption was 226.5MB. Max. memory is 8.0GB. [2023-12-15 21:50:54,058 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 188.7MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 346.46ms. Allocated memory is still 308.3MB. Free memory was 254.5MB in the beginning and 233.8MB in the end (delta: 20.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.93ms. Allocated memory is still 308.3MB. Free memory was 233.5MB in the beginning and 231.1MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.53ms. Allocated memory is still 308.3MB. Free memory was 231.1MB in the beginning and 228.0MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 436.36ms. Allocated memory is still 308.3MB. Free memory was 228.0MB in the beginning and 264.8MB in the end (delta: -36.9MB). Peak memory consumption was 21.4MB. Max. memory is 8.0GB. * TraceAbstraction took 22382.87ms. Allocated memory was 308.3MB in the beginning and 588.3MB in the end (delta: 280.0MB). Free memory was 264.3MB in the beginning and 317.3MB in the end (delta: -53.0MB). Peak memory consumption was 226.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-12-15 21:50:54,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...