/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/seq-pthread/cs_stateful-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 04:00:03,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 04:00:03,660 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-20 04:00:03,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 04:00:03,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 04:00:03,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 04:00:03,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 04:00:03,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 04:00:03,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 04:00:03,710 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 04:00:03,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 04:00:03,711 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 04:00:03,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 04:00:03,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 04:00:03,713 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 04:00:03,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 04:00:03,713 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 04:00:03,713 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 04:00:03,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 04:00:03,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 04:00:03,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 04:00:03,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 04:00:03,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 04:00:03,716 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 04:00:03,716 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 04:00:03,716 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 04:00:03,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 04:00:03,716 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 04:00:03,717 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 04:00:03,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 04:00:03,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 04:00:03,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 04:00:03,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 04:00:03,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 04:00:03,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 04:00:03,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 04:00:03,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 04:00:03,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 04:00:03,720 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 04:00:03,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 04:00:03,720 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 04:00:03,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 04:00:03,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 04:00:03,721 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-20 04:00:03,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 04:00:03,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 04:00:03,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 04:00:03,979 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 04:00:03,979 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 04:00:03,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_stateful-1.i [2023-12-20 04:00:05,028 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 04:00:05,222 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 04:00:05,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-1.i [2023-12-20 04:00:05,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7a17ba3/a920184c06c34ef390a0157f0fec8c0e/FLAG5dc2407b1 [2023-12-20 04:00:05,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7a17ba3/a920184c06c34ef390a0157f0fec8c0e [2023-12-20 04:00:05,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 04:00:05,265 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 04:00:05,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 04:00:05,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 04:00:05,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 04:00:05,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29da7306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05, skipping insertion in model container [2023-12-20 04:00:05,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,315 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 04:00:05,512 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-1.i[23400,23413] [2023-12-20 04:00:05,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 04:00:05,638 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 04:00:05,660 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_stateful-1.i[23400,23413] [2023-12-20 04:00:05,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 04:00:05,715 INFO L206 MainTranslator]: Completed translation [2023-12-20 04:00:05,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05 WrapperNode [2023-12-20 04:00:05,716 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 04:00:05,717 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 04:00:05,717 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 04:00:05,717 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 04:00:05,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,799 INFO L138 Inliner]: procedures = 144, calls = 231, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 570 [2023-12-20 04:00:05,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 04:00:05,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 04:00:05,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 04:00:05,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 04:00:05,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,845 INFO L175 MemorySlicer]: Split 112 memory accesses to 16 slices as follows [2, 8, 8, 7, 3, 20, 12, 10, 10, 0, 3, 4, 12, 3, 3, 7]. 18 percent of accesses are in the largest equivalence class. The 28 initializations are split as follows [2, 3, 3, 0, 0, 6, 6, 2, 2, 0, 0, 0, 4, 0, 0, 0]. The 35 writes are split as follows [0, 2, 2, 1, 1, 8, 3, 4, 4, 0, 1, 2, 4, 1, 1, 1]. [2023-12-20 04:00:05,845 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,863 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,872 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,875 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 04:00:05,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 04:00:05,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 04:00:05,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 04:00:05,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (1/1) ... [2023-12-20 04:00:05,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 04:00:05,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:05,906 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-20 04:00:05,919 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-20 04:00:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-20 04:00:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-20 04:00:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-20 04:00:05,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-12-20 04:00:05,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-20 04:00:05,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-20 04:00:05,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2023-12-20 04:00:05,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2023-12-20 04:00:05,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-20 04:00:05,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-20 04:00:05,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-20 04:00:05,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-20 04:00:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-20 04:00:05,940 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-20 04:00:05,940 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-20 04:00:05,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-20 04:00:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-20 04:00:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-20 04:00:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-20 04:00:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-20 04:00:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-20 04:00:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-20 04:00:05,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-20 04:00:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-20 04:00:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-20 04:00:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-20 04:00:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-20 04:00:05,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-20 04:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-20 04:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-20 04:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-20 04:00:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-20 04:00:05,945 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-20 04:00:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-20 04:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-20 04:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-20 04:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-20 04:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-20 04:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-20 04:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-20 04:00:05,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-20 04:00:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-20 04:00:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-20 04:00:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2023-12-20 04:00:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2023-12-20 04:00:05,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 04:00:05,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 04:00:06,232 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 04:00:06,233 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 04:00:06,526 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L746: SUMMARY for call __CS_cs(); srcloc: null [2023-12-20 04:00:06,534 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-20 04:00:06,534 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint L746-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-20 04:00:06,534 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-20 04:00:06,534 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-20 04:00:06,534 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2023-12-20 04:00:06,534 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2023-12-20 04:00:07,723 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 04:00:07,749 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 04:00:07,749 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 04:00:07,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 04:00:07 BoogieIcfgContainer [2023-12-20 04:00:07,750 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 04:00:07,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 04:00:07,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 04:00:07,753 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 04:00:07,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 04:00:05" (1/3) ... [2023-12-20 04:00:07,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571b2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 04:00:07, skipping insertion in model container [2023-12-20 04:00:07,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 04:00:05" (2/3) ... [2023-12-20 04:00:07,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1571b2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 04:00:07, skipping insertion in model container [2023-12-20 04:00:07,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 04:00:07" (3/3) ... [2023-12-20 04:00:07,754 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_stateful-1.i [2023-12-20 04:00:07,765 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 04:00:07,765 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 04:00:07,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 04:00:07,796 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;@77354ec8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 04:00:07,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 04:00:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 160 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 110 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 04:00:07,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-20 04:00:07,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:07,807 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-20 04:00:07,807 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:07,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1924643995, now seen corresponding path program 1 times [2023-12-20 04:00:07,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:07,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444780607] [2023-12-20 04:00:07,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:07,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:08,144 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-20 04:00:08,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:08,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444780607] [2023-12-20 04:00:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444780607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:08,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:08,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 04:00:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124964235] [2023-12-20 04:00:08,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:08,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 04:00:08,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:08,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 04:00:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 04:00:08,182 INFO L87 Difference]: Start difference. First operand has 160 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 110 states have internal predecessors, (169), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 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-20 04:00:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:09,130 INFO L93 Difference]: Finished difference Result 322 states and 542 transitions. [2023-12-20 04:00:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 04:00:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 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-20 04:00:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:09,139 INFO L225 Difference]: With dead ends: 322 [2023-12-20 04:00:09,139 INFO L226 Difference]: Without dead ends: 161 [2023-12-20 04:00:09,143 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-20 04:00:09,145 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 3 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:09,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 454 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-20 04:00:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-12-20 04:00:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2023-12-20 04:00:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 04:00:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 237 transitions. [2023-12-20 04:00:09,208 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 237 transitions. Word has length 31 [2023-12-20 04:00:09,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:09,208 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 237 transitions. [2023-12-20 04:00:09,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 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-20 04:00:09,209 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 237 transitions. [2023-12-20 04:00:09,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-20 04:00:09,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:09,216 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, 1, 1, 1] [2023-12-20 04:00:09,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 04:00:09,216 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:09,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:09,217 INFO L85 PathProgramCache]: Analyzing trace with hash 883927435, now seen corresponding path program 1 times [2023-12-20 04:00:09,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:09,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113901857] [2023-12-20 04:00:09,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:09,400 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-20 04:00:09,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:09,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113901857] [2023-12-20 04:00:09,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113901857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:09,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:09,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 04:00:09,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052260244] [2023-12-20 04:00:09,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:09,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 04:00:09,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:09,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 04:00:09,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 04:00:09,413 INFO L87 Difference]: Start difference. First operand 159 states and 237 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-20 04:00:09,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:09,477 INFO L93 Difference]: Finished difference Result 317 states and 474 transitions. [2023-12-20 04:00:09,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 04:00:09,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-20 04:00:09,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:09,479 INFO L225 Difference]: With dead ends: 317 [2023-12-20 04:00:09,479 INFO L226 Difference]: Without dead ends: 160 [2023-12-20 04:00:09,481 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-20 04:00:09,482 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:09,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 04:00:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-12-20 04:00:09,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2023-12-20 04:00:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 110 states have (on average 1.4) internal successors, (154), 110 states have internal predecessors, (154), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 04:00:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2023-12-20 04:00:09,491 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 34 [2023-12-20 04:00:09,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:09,491 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 238 transitions. [2023-12-20 04:00:09,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 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-20 04:00:09,491 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 238 transitions. [2023-12-20 04:00:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-20 04:00:09,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:09,494 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, 1, 1, 1, 1] [2023-12-20 04:00:09,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 04:00:09,494 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:09,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1135062502, now seen corresponding path program 1 times [2023-12-20 04:00:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:09,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138374279] [2023-12-20 04:00:09,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:09,715 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-20 04:00:09,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:09,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138374279] [2023-12-20 04:00:09,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138374279] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:09,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328664087] [2023-12-20 04:00:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:09,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:09,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:09,728 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-20 04:00:09,774 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-20 04:00:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:10,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 04:00:10,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:10,034 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-20 04:00:10,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:00:10,047 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-20 04:00:10,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328664087] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:00:10,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:00:10,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-12-20 04:00:10,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862928983] [2023-12-20 04:00:10,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:00:10,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 04:00:10,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 04:00:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-20 04:00:10,048 INFO L87 Difference]: Start difference. First operand 160 states and 238 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-20 04:00:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:10,088 INFO L93 Difference]: Finished difference Result 320 states and 478 transitions. [2023-12-20 04:00:10,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 04:00:10,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-20 04:00:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:10,090 INFO L225 Difference]: With dead ends: 320 [2023-12-20 04:00:10,090 INFO L226 Difference]: Without dead ends: 162 [2023-12-20 04:00:10,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-20 04:00:10,091 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:10,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 04:00:10,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-12-20 04:00:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-12-20 04:00:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 112 states have internal predecessors, (156), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-20 04:00:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2023-12-20 04:00:10,099 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 35 [2023-12-20 04:00:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:10,100 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2023-12-20 04:00:10,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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-20 04:00:10,100 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2023-12-20 04:00:10,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-20 04:00:10,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:10,101 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1] [2023-12-20 04:00:10,115 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-20 04:00:10,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:10,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:10,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:10,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1152945798, now seen corresponding path program 2 times [2023-12-20 04:00:10,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:10,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411664463] [2023-12-20 04:00:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:10,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:10,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-20 04:00:10,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411664463] [2023-12-20 04:00:10,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411664463] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:10,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009551391] [2023-12-20 04:00:10,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 04:00:10,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:10,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:10,466 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-20 04:00:10,503 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-20 04:00:10,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-20 04:00:10,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 04:00:10,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 04:00:10,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:10,801 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-12-20 04:00:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-20 04:00:10,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 04:00:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009551391] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 04:00:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 8 [2023-12-20 04:00:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702524252] [2023-12-20 04:00:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:10,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 04:00:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 04:00:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-20 04:00:10,877 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-20 04:00:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:13,615 INFO L93 Difference]: Finished difference Result 604 states and 922 transitions. [2023-12-20 04:00:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 04:00:13,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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 37 [2023-12-20 04:00:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:13,622 INFO L225 Difference]: With dead ends: 604 [2023-12-20 04:00:13,622 INFO L226 Difference]: Without dead ends: 409 [2023-12-20 04:00:13,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-12-20 04:00:13,626 INFO L413 NwaCegarLoop]: 353 mSDtfsCounter, 549 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:13,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 1492 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-20 04:00:13,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-20 04:00:13,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2023-12-20 04:00:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 264 states have (on average 1.4545454545454546) internal successors, (384), 264 states have internal predecessors, (384), 123 states have call successors, (123), 21 states have call predecessors, (123), 21 states have return successors, (140), 123 states have call predecessors, (140), 123 states have call successors, (140) [2023-12-20 04:00:13,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 647 transitions. [2023-12-20 04:00:13,695 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 647 transitions. Word has length 37 [2023-12-20 04:00:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:13,695 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 647 transitions. [2023-12-20 04:00:13,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 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-20 04:00:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 647 transitions. [2023-12-20 04:00:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-20 04:00:13,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:13,701 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 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, 1] [2023-12-20 04:00:13,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-20 04:00:13,927 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,SelfDestructingSolverStorable3 [2023-12-20 04:00:13,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:13,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1022568785, now seen corresponding path program 1 times [2023-12-20 04:00:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:13,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404974422] [2023-12-20 04:00:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 04:00:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:00:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 04:00:14,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 04:00:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 04:00:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:00:14,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:00:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-20 04:00:14,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404974422] [2023-12-20 04:00:14,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404974422] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:14,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871097888] [2023-12-20 04:00:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:14,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:14,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:14,193 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-20 04:00:14,195 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-20 04:00:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:14,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 04:00:14,536 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-20 04:00:14,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:00:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-20 04:00:14,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871097888] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:00:14,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:00:14,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 9 [2023-12-20 04:00:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067883836] [2023-12-20 04:00:14,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:00:14,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 04:00:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 04:00:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-20 04:00:14,609 INFO L87 Difference]: Start difference. First operand 409 states and 647 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 04:00:19,224 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 [] [2023-12-20 04:00:23,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:26,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:30,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:31,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:31,218 INFO L93 Difference]: Finished difference Result 830 states and 1321 transitions. [2023-12-20 04:00:31,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-20 04:00:31,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 82 [2023-12-20 04:00:31,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:31,220 INFO L225 Difference]: With dead ends: 830 [2023-12-20 04:00:31,220 INFO L226 Difference]: Without dead ends: 429 [2023-12-20 04:00:31,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-12-20 04:00:31,222 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 72 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 122 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:31,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 817 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 429 Invalid, 2 Unknown, 0 Unchecked, 16.6s Time] [2023-12-20 04:00:31,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2023-12-20 04:00:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 419. [2023-12-20 04:00:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 272 states have (on average 1.4448529411764706) internal successors, (393), 274 states have internal predecessors, (393), 123 states have call successors, (123), 21 states have call predecessors, (123), 23 states have return successors, (146), 123 states have call predecessors, (146), 123 states have call successors, (146) [2023-12-20 04:00:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 662 transitions. [2023-12-20 04:00:31,247 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 662 transitions. Word has length 82 [2023-12-20 04:00:31,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:31,247 INFO L495 AbstractCegarLoop]: Abstraction has 419 states and 662 transitions. [2023-12-20 04:00:31,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-20 04:00:31,247 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 662 transitions. [2023-12-20 04:00:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-20 04:00:31,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:31,249 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2023-12-20 04:00:31,268 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-20 04:00:31,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:31,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:31,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 687377012, now seen corresponding path program 2 times [2023-12-20 04:00:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:31,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087863201] [2023-12-20 04:00:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-20 04:00:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:31,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:00:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 04:00:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:31,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 04:00:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:32,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 04:00:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:32,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:00:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:32,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:00:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-20 04:00:32,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:32,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087863201] [2023-12-20 04:00:32,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087863201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:32,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:32,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 04:00:32,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91220022] [2023-12-20 04:00:32,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:32,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 04:00:32,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:32,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 04:00:32,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 04:00:32,027 INFO L87 Difference]: Start difference. First operand 419 states and 662 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 04:00:33,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:36,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:39,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:40,360 INFO L93 Difference]: Finished difference Result 885 states and 1391 transitions. [2023-12-20 04:00:40,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-20 04:00:40,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2023-12-20 04:00:40,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:40,362 INFO L225 Difference]: With dead ends: 885 [2023-12-20 04:00:40,363 INFO L226 Difference]: Without dead ends: 563 [2023-12-20 04:00:40,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2023-12-20 04:00:40,364 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 324 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:40,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 902 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-12-20 04:00:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2023-12-20 04:00:40,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 527. [2023-12-20 04:00:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 336 states have (on average 1.3928571428571428) internal successors, (468), 340 states have internal predecessors, (468), 159 states have call successors, (159), 28 states have call predecessors, (159), 31 states have return successors, (189), 158 states have call predecessors, (189), 159 states have call successors, (189) [2023-12-20 04:00:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 816 transitions. [2023-12-20 04:00:40,392 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 816 transitions. Word has length 88 [2023-12-20 04:00:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:40,392 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 816 transitions. [2023-12-20 04:00:40,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 04:00:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 816 transitions. [2023-12-20 04:00:40,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-20 04:00:40,393 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:40,393 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2023-12-20 04:00:40,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 04:00:40,394 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:40,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 340002696, now seen corresponding path program 1 times [2023-12-20 04:00:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961302255] [2023-12-20 04:00:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:00:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:00:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 04:00:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 04:00:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 04:00:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:00:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:00:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-20 04:00:40,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:40,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961302255] [2023-12-20 04:00:40,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961302255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:00:40,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:00:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 04:00:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982439410] [2023-12-20 04:00:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:00:40,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 04:00:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:40,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 04:00:40,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-20 04:00:40,895 INFO L87 Difference]: Start difference. First operand 527 states and 816 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 04:00:43,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:45,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:46,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:46,411 INFO L93 Difference]: Finished difference Result 847 states and 1307 transitions. [2023-12-20 04:00:46,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-20 04:00:46,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2023-12-20 04:00:46,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:46,415 INFO L225 Difference]: With dead ends: 847 [2023-12-20 04:00:46,415 INFO L226 Difference]: Without dead ends: 520 [2023-12-20 04:00:46,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2023-12-20 04:00:46,416 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 364 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:46,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 900 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-12-20 04:00:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-12-20 04:00:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 484. [2023-12-20 04:00:46,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 313 states have (on average 1.4089456869009584) internal successors, (441), 317 states have internal predecessors, (441), 139 states have call successors, (139), 26 states have call predecessors, (139), 31 states have return successors, (169), 140 states have call predecessors, (169), 139 states have call successors, (169) [2023-12-20 04:00:46,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 749 transitions. [2023-12-20 04:00:46,452 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 749 transitions. Word has length 88 [2023-12-20 04:00:46,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:46,453 INFO L495 AbstractCegarLoop]: Abstraction has 484 states and 749 transitions. [2023-12-20 04:00:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-20 04:00:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 749 transitions. [2023-12-20 04:00:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 04:00:46,457 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:46,457 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-20 04:00:46,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 04:00:46,458 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:46,458 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:46,458 INFO L85 PathProgramCache]: Analyzing trace with hash -489189268, now seen corresponding path program 1 times [2023-12-20 04:00:46,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:46,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068704987] [2023-12-20 04:00:46,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:46,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:00:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:00:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:00:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:00:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:00:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:00:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:00:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:00:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:00:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:00:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:00:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 04:00:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 04:00:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 04:00:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-12-20 04:00:47,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068704987] [2023-12-20 04:00:47,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068704987] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:47,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799550180] [2023-12-20 04:00:47,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:47,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:47,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:47,300 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-20 04:00:47,349 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-20 04:00:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:47,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 1379 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-20 04:00:47,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:47,843 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-20 04:00:48,085 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-20 04:00:48,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:00:48,566 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-20 04:00:48,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799550180] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:00:48,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:00:48,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2023-12-20 04:00:48,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965720442] [2023-12-20 04:00:48,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:00:48,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-20 04:00:48,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:48,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-20 04:00:48,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2023-12-20 04:00:48,568 INFO L87 Difference]: Start difference. First operand 484 states and 749 transitions. Second operand has 28 states, 26 states have (on average 4.384615384615385) internal successors, (114), 24 states have internal predecessors, (114), 11 states have call successors, (37), 11 states have call predecessors, (37), 9 states have return successors, (37), 7 states have call predecessors, (37), 11 states have call successors, (37) [2023-12-20 04:00:50,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:51,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:53,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:56,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:01:02,413 INFO L93 Difference]: Finished difference Result 1431 states and 2210 transitions. [2023-12-20 04:01:02,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-20 04:01:02,414 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 4.384615384615385) internal successors, (114), 24 states have internal predecessors, (114), 11 states have call successors, (37), 11 states have call predecessors, (37), 9 states have return successors, (37), 7 states have call predecessors, (37), 11 states have call successors, (37) Word has length 125 [2023-12-20 04:01:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:01:02,418 INFO L225 Difference]: With dead ends: 1431 [2023-12-20 04:01:02,418 INFO L226 Difference]: Without dead ends: 919 [2023-12-20 04:01:02,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1044, Invalid=3926, Unknown=0, NotChecked=0, Total=4970 [2023-12-20 04:01:02,423 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 1941 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 1312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1952 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 3376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1312 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-12-20 04:01:02,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1952 Valid, 1914 Invalid, 3376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1312 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-12-20 04:01:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2023-12-20 04:01:02,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 776. [2023-12-20 04:01:02,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 498 states have (on average 1.4357429718875503) internal successors, (715), 512 states have internal predecessors, (715), 220 states have call successors, (220), 46 states have call predecessors, (220), 57 states have return successors, (282), 217 states have call predecessors, (282), 220 states have call successors, (282) [2023-12-20 04:01:02,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1217 transitions. [2023-12-20 04:01:02,484 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1217 transitions. Word has length 125 [2023-12-20 04:01:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:01:02,486 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 1217 transitions. [2023-12-20 04:01:02,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 4.384615384615385) internal successors, (114), 24 states have internal predecessors, (114), 11 states have call successors, (37), 11 states have call predecessors, (37), 9 states have return successors, (37), 7 states have call predecessors, (37), 11 states have call successors, (37) [2023-12-20 04:01:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1217 transitions. [2023-12-20 04:01:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2023-12-20 04:01:02,488 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:01:02,488 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-20 04:01:02,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-20 04:01:02,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:01:02,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:01:02,697 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:01:02,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1730320170, now seen corresponding path program 1 times [2023-12-20 04:01:02,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:01:02,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851737412] [2023-12-20 04:01:02,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:02,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:01:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:01:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:01:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:01:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:01:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:01:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:01:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:01:04,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:01:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:01:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:01:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:01:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 04:01:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 04:01:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:05,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-20 04:01:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:05,018 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-12-20 04:01:05,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:01:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851737412] [2023-12-20 04:01:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851737412] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:01:05,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800774354] [2023-12-20 04:01:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:05,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:01:05,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:01:05,020 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 04:01:05,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-20 04:01:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:05,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 1465 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-20 04:01:05,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:01:05,704 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 13 treesize of output 9 [2023-12-20 04:01:09,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:01:09,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:01:09,618 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 50 treesize of output 48 [2023-12-20 04:01:10,503 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2023-12-20 04:01:10,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2023-12-20 04:01:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 68 proven. 4 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-12-20 04:01:36,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:01:36,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-12-20 04:01:36,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2023-12-20 04:01:37,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-20 04:01:37,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-20 04:01:37,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-20 04:01:37,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-20 04:01:37,208 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-12-20 04:01:37,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800774354] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:01:37,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:01:37,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 9] total 40 [2023-12-20 04:01:37,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138549828] [2023-12-20 04:01:37,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:01:37,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-20 04:01:37,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:01:37,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-20 04:01:37,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1407, Unknown=5, NotChecked=0, Total=1560 [2023-12-20 04:01:37,230 INFO L87 Difference]: Start difference. First operand 776 states and 1217 transitions. Second operand has 40 states, 37 states have (on average 4.0) internal successors, (148), 36 states have internal predecessors, (148), 14 states have call successors, (42), 12 states have call predecessors, (42), 13 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) [2023-12-20 04:01:41,485 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 [] [2023-12-20 04:01:47,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:49,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:54,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:58,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:02,907 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 [] [2023-12-20 04:02:05,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:07,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:02:14,956 INFO L93 Difference]: Finished difference Result 1541 states and 2484 transitions. [2023-12-20 04:02:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-12-20 04:02:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 4.0) internal successors, (148), 36 states have internal predecessors, (148), 14 states have call successors, (42), 12 states have call predecessors, (42), 13 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) Word has length 125 [2023-12-20 04:02:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:02:14,960 INFO L225 Difference]: With dead ends: 1541 [2023-12-20 04:02:14,960 INFO L226 Difference]: Without dead ends: 902 [2023-12-20 04:02:14,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 250 SyntacticMatches, 7 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=943, Invalid=5058, Unknown=5, NotChecked=0, Total=6006 [2023-12-20 04:02:14,963 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 1912 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 3863 mSolverCounterSat, 1564 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 2609 SdHoareTripleChecker+Invalid, 5431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1564 IncrementalHoareTripleChecker+Valid, 3863 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.3s IncrementalHoareTripleChecker+Time [2023-12-20 04:02:14,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 2609 Invalid, 5431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1564 Valid, 3863 Invalid, 4 Unknown, 0 Unchecked, 34.3s Time] [2023-12-20 04:02:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2023-12-20 04:02:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 818. [2023-12-20 04:02:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 523 states have (on average 1.435946462715105) internal successors, (751), 538 states have internal predecessors, (751), 234 states have call successors, (234), 46 states have call predecessors, (234), 60 states have return successors, (321), 233 states have call predecessors, (321), 234 states have call successors, (321) [2023-12-20 04:02:15,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1306 transitions. [2023-12-20 04:02:15,069 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1306 transitions. Word has length 125 [2023-12-20 04:02:15,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:02:15,069 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1306 transitions. [2023-12-20 04:02:15,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 4.0) internal successors, (148), 36 states have internal predecessors, (148), 14 states have call successors, (42), 12 states have call predecessors, (42), 13 states have return successors, (42), 13 states have call predecessors, (42), 14 states have call successors, (42) [2023-12-20 04:02:15,070 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1306 transitions. [2023-12-20 04:02:15,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-20 04:02:15,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:02:15,072 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-20 04:02:15,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-20 04:02:15,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:02:15,281 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:02:15,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:02:15,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1422292310, now seen corresponding path program 1 times [2023-12-20 04:02:15,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:02:15,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500952205] [2023-12-20 04:02:15,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:02:15,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:02:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:02:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:02:15,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:02:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:02:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:02:15,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:02:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:02:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:02:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:02:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:02:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:02:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 04:02:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 04:02:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 04:02:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 04:02:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:02:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2023-12-20 04:02:15,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:02:15,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500952205] [2023-12-20 04:02:15,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500952205] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:02:15,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146898194] [2023-12-20 04:02:15,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:02:15,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:02:15,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:02:15,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 04:02:15,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-20 04:02:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:16,313 INFO L262 TraceCheckSpWp]: Trace formula consists of 1646 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 04:02:16,317 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:02:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2023-12-20 04:02:16,326 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 04:02:16,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146898194] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:02:16,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 04:02:16,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-12-20 04:02:16,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364991908] [2023-12-20 04:02:16,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:02:16,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 04:02:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:02:16,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 04:02:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-20 04:02:16,328 INFO L87 Difference]: Start difference. First operand 818 states and 1306 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 04:02:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:02:16,471 INFO L93 Difference]: Finished difference Result 1582 states and 2624 transitions. [2023-12-20 04:02:16,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 04:02:16,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2023-12-20 04:02:16,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:02:16,476 INFO L225 Difference]: With dead ends: 1582 [2023-12-20 04:02:16,476 INFO L226 Difference]: Without dead ends: 826 [2023-12-20 04:02:16,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-20 04:02:16,480 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 0 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 04:02:16,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 04:02:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2023-12-20 04:02:16,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 826. [2023-12-20 04:02:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 531 states have (on average 1.4293785310734464) internal successors, (759), 546 states have internal predecessors, (759), 234 states have call successors, (234), 46 states have call predecessors, (234), 60 states have return successors, (321), 233 states have call predecessors, (321), 234 states have call successors, (321) [2023-12-20 04:02:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1314 transitions. [2023-12-20 04:02:16,569 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1314 transitions. Word has length 142 [2023-12-20 04:02:16,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:02:16,570 INFO L495 AbstractCegarLoop]: Abstraction has 826 states and 1314 transitions. [2023-12-20 04:02:16,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 04:02:16,570 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1314 transitions. [2023-12-20 04:02:16,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-20 04:02:16,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:02:16,573 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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-20 04:02:16,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-20 04:02:16,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:02:16,796 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:02:16,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:02:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash -988563224, now seen corresponding path program 1 times [2023-12-20 04:02:16,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:02:16,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389590850] [2023-12-20 04:02:16,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:02:16,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:02:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:02:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:02:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:02:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:02:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:02:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:02:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:02:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:02:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:02:18,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:02:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:02:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 04:02:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 04:02:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 04:02:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 04:02:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:02:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2023-12-20 04:02:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:02:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389590850] [2023-12-20 04:02:18,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389590850] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:02:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307968343] [2023-12-20 04:02:18,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:02:18,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:02:18,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:02:18,756 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 04:02:18,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-20 04:02:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:02:19,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 1649 conjuncts, 40 conjunts are in the unsatisfiable core [2023-12-20 04:02:19,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:02:19,452 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 8 treesize of output 7 [2023-12-20 04:02:24,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:02:24,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:02:24,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 48 [2023-12-20 04:02:24,606 INFO L349 Elim1Store]: treesize reduction 48, result has 63.1 percent of original size [2023-12-20 04:02:24,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 38 treesize of output 106 [2023-12-20 04:02:24,909 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-20 04:02:24,910 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-20 04:02:24,932 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-20 04:02:24,932 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 25 treesize of output 21 [2023-12-20 04:02:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 60 proven. 31 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-12-20 04:02:24,936 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:02:24,952 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 12 treesize of output 8 [2023-12-20 04:02:25,095 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 56 treesize of output 54 [2023-12-20 04:02:25,474 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 28 treesize of output 26 [2023-12-20 04:02:25,579 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 28 treesize of output 26 [2023-12-20 04:02:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2023-12-20 04:02:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307968343] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:02:25,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:02:25,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 13] total 38 [2023-12-20 04:02:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868305080] [2023-12-20 04:02:25,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:02:25,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-20 04:02:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:02:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-20 04:02:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1237, Unknown=2, NotChecked=0, Total=1406 [2023-12-20 04:02:25,795 INFO L87 Difference]: Start difference. First operand 826 states and 1314 transitions. Second operand has 38 states, 36 states have (on average 4.194444444444445) internal successors, (151), 32 states have internal predecessors, (151), 15 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (45), 13 states have call predecessors, (45), 15 states have call successors, (45) [2023-12-20 04:02:30,046 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 [] [2023-12-20 04:02:35,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:02:39,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:02:41,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:46,411 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 [] [2023-12-20 04:02:48,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:02:53,051 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 [] [2023-12-20 04:02:54,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:05,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:03:05,654 INFO L93 Difference]: Finished difference Result 1898 states and 2990 transitions. [2023-12-20 04:03:05,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-20 04:03:05,654 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 36 states have (on average 4.194444444444445) internal successors, (151), 32 states have internal predecessors, (151), 15 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (45), 13 states have call predecessors, (45), 15 states have call successors, (45) Word has length 142 [2023-12-20 04:03:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:03:05,659 INFO L225 Difference]: With dead ends: 1898 [2023-12-20 04:03:05,659 INFO L226 Difference]: Without dead ends: 1103 [2023-12-20 04:03:05,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 291 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1149, Invalid=5491, Unknown=2, NotChecked=0, Total=6642 [2023-12-20 04:03:05,663 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 3021 mSDsluCounter, 4549 mSDsCounter, 0 mSdLazyCounter, 5778 mSolverCounterSat, 2114 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3021 SdHoareTripleChecker+Valid, 4963 SdHoareTripleChecker+Invalid, 7899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2114 IncrementalHoareTripleChecker+Valid, 5778 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.1s IncrementalHoareTripleChecker+Time [2023-12-20 04:03:05,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3021 Valid, 4963 Invalid, 7899 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2114 Valid, 5778 Invalid, 7 Unknown, 0 Unchecked, 36.1s Time] [2023-12-20 04:03:05,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2023-12-20 04:03:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 947. [2023-12-20 04:03:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 617 states have (on average 1.353322528363047) internal successors, (835), 639 states have internal predecessors, (835), 251 states have call successors, (251), 60 states have call predecessors, (251), 78 states have return successors, (329), 247 states have call predecessors, (329), 251 states have call successors, (329) [2023-12-20 04:03:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1415 transitions. [2023-12-20 04:03:05,804 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1415 transitions. Word has length 142 [2023-12-20 04:03:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:03:05,804 INFO L495 AbstractCegarLoop]: Abstraction has 947 states and 1415 transitions. [2023-12-20 04:03:05,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 36 states have (on average 4.194444444444445) internal successors, (151), 32 states have internal predecessors, (151), 15 states have call successors, (47), 12 states have call predecessors, (47), 13 states have return successors, (45), 13 states have call predecessors, (45), 15 states have call successors, (45) [2023-12-20 04:03:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1415 transitions. [2023-12-20 04:03:05,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-12-20 04:03:05,807 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:03:05,807 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:03:05,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-20 04:03:06,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:03:06,016 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:03:06,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:03:06,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1932769037, now seen corresponding path program 1 times [2023-12-20 04:03:06,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:03:06,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706396223] [2023-12-20 04:03:06,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:03:06,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:03:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:03:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:03:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:03:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:03:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:03:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:03:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:03:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:03:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:03:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:03:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:03:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:03:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 04:03:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:03:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 04:03:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 04:03:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 04:03:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:03:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:03:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:07,451 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 257 trivial. 0 not checked. [2023-12-20 04:03:07,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:03:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706396223] [2023-12-20 04:03:07,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706396223] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:03:07,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318223318] [2023-12-20 04:03:07,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:03:07,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:03:07,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:03:07,453 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 04:03:07,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-20 04:03:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:08,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 1703 conjuncts, 106 conjunts are in the unsatisfiable core [2023-12-20 04:03:08,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:03:08,295 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 30 treesize of output 32 [2023-12-20 04:03:08,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:03:08,300 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 29 treesize of output 22 [2023-12-20 04:03:08,310 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-20 04:03:08,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2023-12-20 04:03:08,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:03:08,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-20 04:03:08,748 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 8 treesize of output 7 [2023-12-20 04:03:08,754 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 8 treesize of output 7 [2023-12-20 04:03:08,852 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 13 treesize of output 9 [2023-12-20 04:03:09,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:03:09,008 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 1 case distinctions, treesize of input 26 treesize of output 28 [2023-12-20 04:03:09,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:03:09,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 10 [2023-12-20 04:03:09,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-20 04:03:09,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-12-20 04:03:09,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2023-12-20 04:03:09,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-12-20 04:03:09,333 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 17 treesize of output 13 [2023-12-20 04:03:09,423 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 144 proven. 8 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-20 04:03:09,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:03:09,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318223318] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:03:09,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-20 04:03:09,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 30 [2023-12-20 04:03:09,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775908731] [2023-12-20 04:03:09,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-20 04:03:09,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-20 04:03:09,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:03:09,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-20 04:03:09,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2023-12-20 04:03:09,665 INFO L87 Difference]: Start difference. First operand 947 states and 1415 transitions. Second operand has 30 states, 29 states have (on average 5.137931034482759) internal successors, (149), 24 states have internal predecessors, (149), 12 states have call successors, (38), 12 states have call predecessors, (38), 10 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2023-12-20 04:03:11,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:14,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:19,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:23,423 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 [] [2023-12-20 04:03:27,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:28,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:03:35,889 INFO L93 Difference]: Finished difference Result 1539 states and 2253 transitions. [2023-12-20 04:03:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-20 04:03:35,890 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.137931034482759) internal successors, (149), 24 states have internal predecessors, (149), 12 states have call successors, (38), 12 states have call predecessors, (38), 10 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) Word has length 161 [2023-12-20 04:03:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:03:35,893 INFO L225 Difference]: With dead ends: 1539 [2023-12-20 04:03:35,893 INFO L226 Difference]: Without dead ends: 895 [2023-12-20 04:03:35,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1854 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=897, Invalid=5109, Unknown=0, NotChecked=0, Total=6006 [2023-12-20 04:03:35,896 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 1497 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 3527 mSolverCounterSat, 1081 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 3067 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 3527 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2023-12-20 04:03:35,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 3067 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1081 Valid, 3527 Invalid, 1 Unknown, 0 Unchecked, 22.8s Time] [2023-12-20 04:03:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2023-12-20 04:03:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 660. [2023-12-20 04:03:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 433 states have (on average 1.3071593533487298) internal successors, (566), 449 states have internal predecessors, (566), 165 states have call successors, (165), 45 states have call predecessors, (165), 61 states have return successors, (215), 165 states have call predecessors, (215), 165 states have call successors, (215) [2023-12-20 04:03:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 946 transitions. [2023-12-20 04:03:35,987 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 946 transitions. Word has length 161 [2023-12-20 04:03:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:03:35,988 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 946 transitions. [2023-12-20 04:03:35,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.137931034482759) internal successors, (149), 24 states have internal predecessors, (149), 12 states have call successors, (38), 12 states have call predecessors, (38), 10 states have return successors, (38), 12 states have call predecessors, (38), 12 states have call successors, (38) [2023-12-20 04:03:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 946 transitions. [2023-12-20 04:03:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-20 04:03:35,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:03:35,991 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:03:36,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-20 04:03:36,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-20 04:03:36,201 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:03:36,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:03:36,201 INFO L85 PathProgramCache]: Analyzing trace with hash 818540071, now seen corresponding path program 1 times [2023-12-20 04:03:36,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:03:36,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029229923] [2023-12-20 04:03:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:03:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:03:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:03:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:03:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:03:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:03:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:03:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:03:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:03:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:03:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:03:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:03:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:03:37,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 04:03:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 04:03:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 04:03:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 04:03:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:03:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:37,676 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-20 04:03:37,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:03:37,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029229923] [2023-12-20 04:03:37,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029229923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:03:37,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:03:37,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 04:03:37,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780854138] [2023-12-20 04:03:37,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:03:37,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 04:03:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:03:37,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 04:03:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-12-20 04:03:37,678 INFO L87 Difference]: Start difference. First operand 660 states and 946 transitions. Second operand has 13 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-20 04:03:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:03:40,006 INFO L93 Difference]: Finished difference Result 1598 states and 2270 transitions. [2023-12-20 04:03:40,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-20 04:03:40,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 143 [2023-12-20 04:03:40,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:03:40,038 INFO L225 Difference]: With dead ends: 1598 [2023-12-20 04:03:40,039 INFO L226 Difference]: Without dead ends: 958 [2023-12-20 04:03:40,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2023-12-20 04:03:40,043 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 779 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-20 04:03:40,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 575 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-20 04:03:40,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2023-12-20 04:03:40,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 819. [2023-12-20 04:03:40,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 546 states have (on average 1.2857142857142858) internal successors, (702), 554 states have internal predecessors, (702), 194 states have call successors, (194), 49 states have call predecessors, (194), 78 states have return successors, (281), 215 states have call predecessors, (281), 194 states have call successors, (281) [2023-12-20 04:03:40,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1177 transitions. [2023-12-20 04:03:40,187 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1177 transitions. Word has length 143 [2023-12-20 04:03:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:03:40,187 INFO L495 AbstractCegarLoop]: Abstraction has 819 states and 1177 transitions. [2023-12-20 04:03:40,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2023-12-20 04:03:40,188 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1177 transitions. [2023-12-20 04:03:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-20 04:03:40,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:03:40,191 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:03:40,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-20 04:03:40,192 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:03:40,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:03:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash 880579685, now seen corresponding path program 1 times [2023-12-20 04:03:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:03:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588290526] [2023-12-20 04:03:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:03:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:03:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:03:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:03:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:03:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:03:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:03:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:03:42,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:03:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:03:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:03:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:03:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:03:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 04:03:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-20 04:03:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 04:03:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 04:03:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:03:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:42,336 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-20 04:03:42,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:03:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588290526] [2023-12-20 04:03:42,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588290526] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:03:42,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166351614] [2023-12-20 04:03:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:03:42,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:03:42,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:03:42,338 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 04:03:42,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-20 04:03:43,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:03:43,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 1609 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-20 04:03:43,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:03:43,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-20 04:03:44,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-12-20 04:03:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 72 proven. 40 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-20 04:03:44,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:03:44,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-20 04:03:44,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-20 04:03:45,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-20 04:03:45,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-20 04:03:45,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-20 04:03:45,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-20 04:03:46,252 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 44 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2023-12-20 04:03:46,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166351614] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:03:46,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:03:46,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27, 21] total 59 [2023-12-20 04:03:46,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076715299] [2023-12-20 04:03:46,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:03:46,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-12-20 04:03:46,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:03:46,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-12-20 04:03:46,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=3044, Unknown=0, NotChecked=0, Total=3422 [2023-12-20 04:03:46,254 INFO L87 Difference]: Start difference. First operand 819 states and 1177 transitions. Second operand has 59 states, 53 states have (on average 3.5283018867924527) internal successors, (187), 53 states have internal predecessors, (187), 25 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (48), 23 states have call predecessors, (48), 25 states have call successors, (48) [2023-12-20 04:03:47,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:53,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:55,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:59,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:03,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:07,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:08,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:12,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:16,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:30,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:04:30,937 INFO L93 Difference]: Finished difference Result 1333 states and 1811 transitions. [2023-12-20 04:04:30,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-20 04:04:30,938 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 53 states have (on average 3.5283018867924527) internal successors, (187), 53 states have internal predecessors, (187), 25 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (48), 23 states have call predecessors, (48), 25 states have call successors, (48) Word has length 143 [2023-12-20 04:04:30,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:04:30,941 INFO L225 Difference]: With dead ends: 1333 [2023-12-20 04:04:30,941 INFO L226 Difference]: Without dead ends: 845 [2023-12-20 04:04:30,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 290 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5873 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3211, Invalid=17095, Unknown=0, NotChecked=0, Total=20306 [2023-12-20 04:04:30,948 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 6286 mSDsluCounter, 4024 mSDsCounter, 0 mSdLazyCounter, 7056 mSolverCounterSat, 5223 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6286 SdHoareTripleChecker+Valid, 4339 SdHoareTripleChecker+Invalid, 12283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5223 IncrementalHoareTripleChecker+Valid, 7056 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2023-12-20 04:04:30,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6286 Valid, 4339 Invalid, 12283 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5223 Valid, 7056 Invalid, 4 Unknown, 0 Unchecked, 36.7s Time] [2023-12-20 04:04:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2023-12-20 04:04:31,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 645. [2023-12-20 04:04:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 434 states have (on average 1.1935483870967742) internal successors, (518), 424 states have internal predecessors, (518), 144 states have call successors, (144), 41 states have call predecessors, (144), 66 states have return successors, (188), 179 states have call predecessors, (188), 144 states have call successors, (188) [2023-12-20 04:04:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 850 transitions. [2023-12-20 04:04:31,157 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 850 transitions. Word has length 143 [2023-12-20 04:04:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:04:31,157 INFO L495 AbstractCegarLoop]: Abstraction has 645 states and 850 transitions. [2023-12-20 04:04:31,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 53 states have (on average 3.5283018867924527) internal successors, (187), 53 states have internal predecessors, (187), 25 states have call successors, (48), 19 states have call predecessors, (48), 21 states have return successors, (48), 23 states have call predecessors, (48), 25 states have call successors, (48) [2023-12-20 04:04:31,158 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 850 transitions. [2023-12-20 04:04:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 04:04:31,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:04:31,178 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:04:31,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-20 04:04:31,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-20 04:04:31,388 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:04:31,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:04:31,388 INFO L85 PathProgramCache]: Analyzing trace with hash -542242815, now seen corresponding path program 1 times [2023-12-20 04:04:31,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:04:31,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569513599] [2023-12-20 04:04:31,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:04:31,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:04:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-12-20 04:04:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 04:04:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 04:04:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 04:04:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 04:04:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:04:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-20 04:04:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-20 04:04:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 04:04:36,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 04:04:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-20 04:04:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-20 04:04:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 04:04:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:37,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 04:04:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 04:04:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:04:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:38,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:04:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:38,507 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 42 proven. 10 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2023-12-20 04:04:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:04:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569513599] [2023-12-20 04:04:38,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569513599] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:04:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028509464] [2023-12-20 04:04:38,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:04:38,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:04:38,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:04:38,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-20 04:04:38,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-20 04:04:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:41,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 1546 conjuncts, 109 conjunts are in the unsatisfiable core [2023-12-20 04:04:41,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:04:41,570 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 30 treesize of output 32 [2023-12-20 04:04:41,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:04:41,574 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 29 treesize of output 22 [2023-12-20 04:04:41,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2023-12-20 04:04:42,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 21 treesize of output 13 [2023-12-20 04:04:42,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-20 04:04:43,146 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 0 case distinctions, treesize of input 25 treesize of output 17 [2023-12-20 04:04:43,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-12-20 04:04:43,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:04:43,706 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 26 treesize of output 30 [2023-12-20 04:04:44,145 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 0 case distinctions, treesize of input 43 treesize of output 36 [2023-12-20 04:04:44,177 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2023-12-20 04:04:44,178 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 38 treesize of output 52 [2023-12-20 04:04:46,220 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 0 case distinctions, treesize of input 51 treesize of output 40 [2023-12-20 04:04:46,286 INFO L349 Elim1Store]: treesize reduction 80, result has 27.3 percent of original size [2023-12-20 04:04:46,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 66 [2023-12-20 04:04:49,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-20 04:04:50,920 INFO L349 Elim1Store]: treesize reduction 192, result has 63.1 percent of original size [2023-12-20 04:04:50,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 65 case distinctions, treesize of input 207 treesize of output 487 [2023-12-20 04:04:52,786 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:05:14,864 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:05:39,835 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:51,201 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:51,734 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:52,292 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:52,897 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:53,524 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:54,115 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:54,572 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:54,966 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:55,555 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:56,119 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:56,603 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:57,677 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:58,176 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:58,639 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:59,173 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:07:59,704 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:00,060 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:00,404 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:01,007 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:01,640 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:02,337 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:03,480 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:04,226 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:05,251 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:05,617 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:06,127 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:07,083 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:07,628 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:08,559 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:09,220 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:09,548 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:09,927 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:10,219 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:10,547 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:11,265 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:11,544 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:11,928 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:12,544 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:08:13,996 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:00,402 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:01,712 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:02,359 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:02,852 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:06,706 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:11,138 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:16,497 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:16,870 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:20,002 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:20,312 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:21,340 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:22,127 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:22,442 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:22,655 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:23,417 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:23,820 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:24,413 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:25,111 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:25,535 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:26,158 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:26,419 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:26,763 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:27,380 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:28,080 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:28,603 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:28,884 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:29,399 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:29,841 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:30,422 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:31,191 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:32,061 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:32,490 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:32,869 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:33,486 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:33,824 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:34,148 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:34,447 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:35,070 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:35,814 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:36,337 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:37,149 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:42,869 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:43,576 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:49,128 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:50,281 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:10:51,356 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-20 04:12:37,415 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-12-20 04:12:37,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2023-12-20 04:12:37,417 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-20 04:12:37,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-20 04:12:37,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-20 04:12:37,634 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 68 more [2023-12-20 04:12:37,638 INFO L158 Benchmark]: Toolchain (without parser) took 752373.44ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 134.8MB in the beginning and 842.6MB in the end (delta: -707.9MB). Peak memory consumption was 772.7MB. Max. memory is 8.0GB. [2023-12-20 04:12:37,638 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 183.5MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 04:12:37,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.65ms. Allocated memory is still 183.5MB. Free memory was 134.4MB in the beginning and 108.5MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-20 04:12:37,638 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.33ms. Allocated memory is still 183.5MB. Free memory was 108.5MB in the beginning and 103.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 04:12:37,638 INFO L158 Benchmark]: Boogie Preprocessor took 82.18ms. Allocated memory is still 183.5MB. Free memory was 103.3MB in the beginning and 95.6MB in the end (delta: 7.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-20 04:12:37,639 INFO L158 Benchmark]: RCFGBuilder took 1866.68ms. Allocated memory is still 183.5MB. Free memory was 95.6MB in the beginning and 101.3MB in the end (delta: -5.7MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2023-12-20 04:12:37,639 INFO L158 Benchmark]: TraceAbstraction took 749886.82ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 100.8MB in the beginning and 842.6MB in the end (delta: -741.9MB). Peak memory consumption was 738.8MB. Max. memory is 8.0GB. [2023-12-20 04:12:37,640 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.51ms. Allocated memory is still 183.5MB. Free memory is still 140.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 450.65ms. Allocated memory is still 183.5MB. Free memory was 134.4MB in the beginning and 108.5MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.33ms. Allocated memory is still 183.5MB. Free memory was 108.5MB in the beginning and 103.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 82.18ms. Allocated memory is still 183.5MB. Free memory was 103.3MB in the beginning and 95.6MB in the end (delta: 7.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1866.68ms. Allocated memory is still 183.5MB. Free memory was 95.6MB in the beginning and 101.3MB in the end (delta: -5.7MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * TraceAbstraction took 749886.82ms. Allocated memory was 183.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 100.8MB in the beginning and 842.6MB in the end (delta: -741.9MB). Peak memory consumption was 738.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...