/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_lamport.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 03:58:56,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 03:58:56,935 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 03:58:56,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 03:58:56,940 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 03:58:56,963 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 03:58:56,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 03:58:56,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 03:58:56,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 03:58:56,968 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 03:58:56,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 03:58:56,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 03:58:56,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 03:58:56,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 03:58:56,971 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 03:58:56,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 03:58:56,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 03:58:56,971 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 03:58:56,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 03:58:56,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 03:58:56,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 03:58:56,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 03:58:56,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 03:58:56,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 03:58:56,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 03:58:56,973 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 03:58:56,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 03:58:56,973 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 03:58:56,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 03:58:56,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 03:58:56,975 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 03:58:56,975 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 03:58:56,975 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 03:58:56,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 03:58:56,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 03:58:56,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 03:58:56,975 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 03:58:56,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 03:58:56,976 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 03:58:56,976 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 03:58:56,976 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 03:58:56,976 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 03:58:56,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 03:58:56,976 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 03:58:57,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 03:58:57,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 03:58:57,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 03:58:57,206 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 03:58:57,206 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 03:58:57,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_lamport.i [2023-12-20 03:58:58,205 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 03:58:58,427 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 03:58:58,428 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_lamport.i [2023-12-20 03:58:58,445 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cdb30c6f/a006809bc439465dbb864ec9cf5a32ad/FLAGba5905011 [2023-12-20 03:58:58,769 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cdb30c6f/a006809bc439465dbb864ec9cf5a32ad [2023-12-20 03:58:58,771 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 03:58:58,772 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 03:58:58,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 03:58:58,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 03:58:58,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 03:58:58,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 03:58:58" (1/1) ... [2023-12-20 03:58:58,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4baf99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:58, skipping insertion in model container [2023-12-20 03:58:58,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 03:58:58" (1/1) ... [2023-12-20 03:58:58,821 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 03:58:59,062 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_lamport.i[23604,23617] [2023-12-20 03:58:59,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 03:58:59,195 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 03:58:59,226 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_lamport.i[23604,23617] [2023-12-20 03:58:59,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 03:58:59,314 INFO L206 MainTranslator]: Completed translation [2023-12-20 03:58:59,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59 WrapperNode [2023-12-20 03:58:59,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 03:58:59,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 03:58:59,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 03:58:59,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 03:58:59,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,337 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,369 INFO L138 Inliner]: procedures = 145, calls = 351, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 469 [2023-12-20 03:58:59,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 03:58:59,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 03:58:59,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 03:58:59,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 03:58:59,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,405 INFO L175 MemorySlicer]: Split 160 memory accesses to 19 slices as follows [2, 5, 5, 8, 5, 8, 29, 21, 7, 7, 0, 6, 7, 13, 7, 7, 5, 13, 5]. 18 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 0, 0, 3, 0, 3, 9, 9, 3, 3, 0, 2, 3, 0, 3, 3, 0, 0, 0]. The 40 writes are split as follows [0, 1, 1, 2, 1, 2, 11, 6, 2, 2, 0, 2, 2, 1, 2, 2, 1, 1, 1]. [2023-12-20 03:58:59,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 03:58:59,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 03:58:59,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 03:58:59,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 03:58:59,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (1/1) ... [2023-12-20 03:58:59,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 03:58:59,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:58:59,506 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 03:58:59,526 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 03:58:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-20 03:58:59,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-20 03:58:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-20 03:58:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-20 03:58:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-20 03:58:59,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-20 03:58:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-20 03:58:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-12-20 03:58:59,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-20 03:58:59,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-20 03:58:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-20 03:58:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-20 03:58:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-20 03:58:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-20 03:58:59,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-12-20 03:58:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-12-20 03:58:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-12-20 03:58:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-12-20 03:58:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-12-20 03:58:59,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 03:58:59,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-20 03:58:59,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2023-12-20 03:58:59,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2023-12-20 03:58:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2023-12-20 03:58:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2023-12-20 03:58:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2023-12-20 03:58:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2023-12-20 03:58:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2023-12-20 03:58:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2023-12-20 03:58:59,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2023-12-20 03:58:59,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-12-20 03:58:59,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-12-20 03:58:59,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2023-12-20 03:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2023-12-20 03:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2023-12-20 03:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2023-12-20 03:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2023-12-20 03:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2023-12-20 03:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2023-12-20 03:58:59,545 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2023-12-20 03:58:59,545 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-20 03:58:59,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-12-20 03:58:59,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2023-12-20 03:58:59,547 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2023-12-20 03:58:59,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-20 03:58:59,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-12-20 03:58:59,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 03:58:59,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 03:58:59,784 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 03:58:59,786 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 03:59:04,201 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 03:59:04,232 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 03:59:04,232 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-20 03:59:04,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 03:59:04 BoogieIcfgContainer [2023-12-20 03:59:04,233 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 03:59:04,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 03:59:04,235 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 03:59:04,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 03:59:04,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 03:58:58" (1/3) ... [2023-12-20 03:59:04,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be58a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 03:59:04, skipping insertion in model container [2023-12-20 03:59:04,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 03:58:59" (2/3) ... [2023-12-20 03:59:04,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be58a78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 03:59:04, skipping insertion in model container [2023-12-20 03:59:04,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 03:59:04" (3/3) ... [2023-12-20 03:59:04,239 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lamport.i [2023-12-20 03:59:04,251 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 03:59:04,251 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 03:59:04,282 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 03:59:04,286 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;@52c6b004, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 03:59:04,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 03:59:04,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 68 states have (on average 1.338235294117647) internal successors, (91), 69 states have internal predecessors, (91), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 03:59:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-20 03:59:04,301 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:59:04,301 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:04,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 03:59:04,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:59:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash -418329354, now seen corresponding path program 1 times [2023-12-20 03:59:04,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:59:04,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493079293] [2023-12-20 03:59:04,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:04,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:59:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-20 03:59:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 03:59:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 03:59:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 03:59:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 03:59:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 03:59:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 03:59:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 03:59:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 03:59:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 03:59:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 03:59:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 03:59:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 03:59:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 03:59:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 03:59:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-20 03:59:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 03:59:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 03:59:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 03:59:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 03:59:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 03:59:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 03:59:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-20 03:59:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:59:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493079293] [2023-12-20 03:59:04,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493079293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:59:04,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:59:04,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:59:04,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840080007] [2023-12-20 03:59:04,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:59:04,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:59:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:59:04,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:59:04,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:59:04,904 INFO L87 Difference]: Start difference. First operand has 111 states, 68 states have (on average 1.338235294117647) internal successors, (91), 69 states have internal predecessors, (91), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-20 03:59:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:59:04,989 INFO L93 Difference]: Finished difference Result 224 states and 366 transitions. [2023-12-20 03:59:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:59:04,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2023-12-20 03:59:04,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:59:04,996 INFO L225 Difference]: With dead ends: 224 [2023-12-20 03:59:04,997 INFO L226 Difference]: Without dead ends: 112 [2023-12-20 03:59:05,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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 03:59:05,002 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 3 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:59:05,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 303 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:59:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-20 03:59:05,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2023-12-20 03:59:05,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 03:59:05,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2023-12-20 03:59:05,037 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 143 [2023-12-20 03:59:05,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:59:05,037 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2023-12-20 03:59:05,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-20 03:59:05,038 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2023-12-20 03:59:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-20 03:59:05,041 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:59:05,041 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:05,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 03:59:05,041 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 03:59:05,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:59:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2117031662, now seen corresponding path program 1 times [2023-12-20 03:59:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:59:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982231485] [2023-12-20 03:59:05,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:59:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-20 03:59:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 03:59:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 03:59:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 03:59:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 03:59:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-20 03:59:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-20 03:59:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-20 03:59:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-20 03:59:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-20 03:59:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-20 03:59:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-20 03:59:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-20 03:59:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-20 03:59:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 03:59:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 03:59:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-20 03:59:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-20 03:59:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-12-20 03:59:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-20 03:59:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 03:59:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 03:59:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-20 03:59:05,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:59:05,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982231485] [2023-12-20 03:59:05,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982231485] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:59:05,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:59:05,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 03:59:05,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400742035] [2023-12-20 03:59:05,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:59:05,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 03:59:05,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:59:05,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 03:59:05,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 03:59:05,355 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-20 03:59:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:59:05,419 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2023-12-20 03:59:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 03:59:05,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2023-12-20 03:59:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:59:05,423 INFO L225 Difference]: With dead ends: 219 [2023-12-20 03:59:05,423 INFO L226 Difference]: Without dead ends: 111 [2023-12-20 03:59:05,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 03:59:05,426 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:59:05,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:59:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-12-20 03:59:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-12-20 03:59:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 69 states have internal predecessors, (87), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 03:59:05,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-12-20 03:59:05,441 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 146 [2023-12-20 03:59:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:59:05,442 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-12-20 03:59:05,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-20 03:59:05,442 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-12-20 03:59:05,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-20 03:59:05,444 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:59:05,444 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:59:05,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 03:59:05,444 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 03:59:05,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:59:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1200437592, now seen corresponding path program 1 times [2023-12-20 03:59:05,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:59:05,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375761894] [2023-12-20 03:59:05,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:05,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:59:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 03:59:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 03:59:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 03:59:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 03:59:05,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-20 03:59:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 03:59:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 03:59:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-20 03:59:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-20 03:59:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-20 03:59:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-20 03:59:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 03:59:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 03:59:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 03:59:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 03:59:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 03:59:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 03:59:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-20 03:59:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-20 03:59:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-20 03:59:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-20 03:59:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 03:59:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-20 03:59:05,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:59:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375761894] [2023-12-20 03:59:05,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375761894] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:59:05,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947877590] [2023-12-20 03:59:05,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:05,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:59:05,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:59:05,806 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 03:59:05,848 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 03:59:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:06,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 03:59:06,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:59:06,490 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-20 03:59:06,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:59:06,557 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-20 03:59:06,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947877590] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:59:06,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:59:06,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2023-12-20 03:59:06,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363193441] [2023-12-20 03:59:06,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:59:06,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 03:59:06,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:59:06,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 03:59:06,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-20 03:59:06,560 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-20 03:59:06,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:59:06,608 INFO L93 Difference]: Finished difference Result 222 states and 320 transitions. [2023-12-20 03:59:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 03:59:06,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 147 [2023-12-20 03:59:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:59:06,609 INFO L225 Difference]: With dead ends: 222 [2023-12-20 03:59:06,609 INFO L226 Difference]: Without dead ends: 113 [2023-12-20 03:59:06,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 335 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 03:59:06,610 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 03:59:06,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 455 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 03:59:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-20 03:59:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-20 03:59:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 71 states have (on average 1.2535211267605635) internal successors, (89), 71 states have internal predecessors, (89), 36 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-20 03:59:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2023-12-20 03:59:06,617 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 147 [2023-12-20 03:59:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:59:06,618 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2023-12-20 03:59:06,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-20 03:59:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2023-12-20 03:59:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-20 03:59:06,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:59:06,620 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:59:06,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-20 03:59:06,827 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 03:59:06,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 03:59:06,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:59:06,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1822780392, now seen corresponding path program 2 times [2023-12-20 03:59:06,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:59:06,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987971273] [2023-12-20 03:59:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:06,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:59:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-12-20 03:59:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-20 03:59:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 03:59:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 03:59:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-20 03:59:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-20 03:59:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 03:59:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 03:59:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 03:59:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 03:59:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-20 03:59:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-20 03:59:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-20 03:59:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-20 03:59:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-20 03:59:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-20 03:59:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-20 03:59:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-12-20 03:59:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 03:59:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 03:59:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 03:59:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 03:59:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:07,067 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2023-12-20 03:59:07,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:59:07,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987971273] [2023-12-20 03:59:07,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987971273] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:59:07,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055968308] [2023-12-20 03:59:07,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-20 03:59:07,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:59:07,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:59:07,069 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 03:59:07,104 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 03:59:07,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-20 03:59:07,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-20 03:59:07,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-20 03:59:07,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:59:07,519 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 03:59:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2023-12-20 03:59:07,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 03:59:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055968308] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:59:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 03:59:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 9 [2023-12-20 03:59:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347687616] [2023-12-20 03:59:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:59:07,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-20 03:59:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:59:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-20 03:59:07,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-20 03:59:07,680 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-20 03:59:11,727 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 03:59:15,735 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 03:59:19,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 03:59:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:59:20,146 INFO L93 Difference]: Finished difference Result 408 states and 598 transitions. [2023-12-20 03:59:20,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-20 03:59:20,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2023-12-20 03:59:20,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:59:20,150 INFO L225 Difference]: With dead ends: 408 [2023-12-20 03:59:20,150 INFO L226 Difference]: Without dead ends: 214 [2023-12-20 03:59:20,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 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 03:59:20,151 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 299 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 82 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-12-20 03:59:20,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 724 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 208 Invalid, 3 Unknown, 0 Unchecked, 12.4s Time] [2023-12-20 03:59:20,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-12-20 03:59:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2023-12-20 03:59:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 137 states have (on average 1.3065693430656935) internal successors, (179), 137 states have internal predecessors, (179), 61 states have call successors, (61), 15 states have call predecessors, (61), 15 states have return successors, (70), 61 states have call predecessors, (70), 61 states have call successors, (70) [2023-12-20 03:59:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 310 transitions. [2023-12-20 03:59:20,180 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 310 transitions. Word has length 149 [2023-12-20 03:59:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:59:20,180 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 310 transitions. [2023-12-20 03:59:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2023-12-20 03:59:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 310 transitions. [2023-12-20 03:59:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2023-12-20 03:59:20,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:59:20,186 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 4, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:59:20,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-20 03:59:20,393 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 03:59:20,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 03:59:20,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:59:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash -509828939, now seen corresponding path program 1 times [2023-12-20 03:59:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:59:20,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778495934] [2023-12-20 03:59:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:59:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 03:59:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 03:59:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 03:59:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 03:59:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 03:59:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 03:59:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 03:59:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-20 03:59:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 03:59:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 03:59:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 03:59:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 03:59:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 03:59:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-20 03:59:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-20 03:59:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-20 03:59:20,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-20 03:59:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 03:59:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-20 03:59:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 03:59:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 03:59:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 03:59:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 03:59:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-20 03:59:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-20 03:59:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 03:59:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 03:59:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 03:59:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 03:59:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2023-12-20 03:59:20,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:59:20,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778495934] [2023-12-20 03:59:20,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778495934] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 03:59:20,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373789343] [2023-12-20 03:59:20,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:20,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 03:59:20,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 03:59:20,861 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 03:59:20,896 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 03:59:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:21,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 1522 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-20 03:59:21,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 03:59:21,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2023-12-20 03:59:21,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 03:59:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1334 trivial. 0 not checked. [2023-12-20 03:59:21,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373789343] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 03:59:21,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 03:59:21,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3, 4] total 10 [2023-12-20 03:59:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803208398] [2023-12-20 03:59:21,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 03:59:21,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-20 03:59:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:59:21,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-20 03:59:21,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-20 03:59:21,571 INFO L87 Difference]: Start difference. First operand 214 states and 310 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (70), 6 states have call predecessors, (70), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2023-12-20 03:59:25,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 03:59:29,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 03:59:33,725 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 03:59:34,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 03:59:34,238 INFO L93 Difference]: Finished difference Result 444 states and 642 transitions. [2023-12-20 03:59:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-20 03:59:34,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (70), 6 states have call predecessors, (70), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 213 [2023-12-20 03:59:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 03:59:34,240 INFO L225 Difference]: With dead ends: 444 [2023-12-20 03:59:34,240 INFO L226 Difference]: Without dead ends: 238 [2023-12-20 03:59:34,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 487 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-20 03:59:34,241 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 45 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 74 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2023-12-20 03:59:34,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 519 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 437 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2023-12-20 03:59:34,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-12-20 03:59:34,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 232. [2023-12-20 03:59:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 155 states have internal predecessors, (196), 61 states have call successors, (61), 15 states have call predecessors, (61), 18 states have return successors, (75), 61 states have call predecessors, (75), 61 states have call successors, (75) [2023-12-20 03:59:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 332 transitions. [2023-12-20 03:59:34,277 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 332 transitions. Word has length 213 [2023-12-20 03:59:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 03:59:34,278 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 332 transitions. [2023-12-20 03:59:34,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 6 states have internal predecessors, (94), 2 states have call successors, (70), 6 states have call predecessors, (70), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2023-12-20 03:59:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 332 transitions. [2023-12-20 03:59:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-12-20 03:59:34,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 03:59:34,286 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 03:59:34,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-20 03:59:34,486 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 03:59:34,487 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 03:59:34,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 03:59:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1561945135, now seen corresponding path program 2 times [2023-12-20 03:59:34,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 03:59:34,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450396671] [2023-12-20 03:59:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 03:59:34,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 03:59:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-20 03:59:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 03:59:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 03:59:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 03:59:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 03:59:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 03:59:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 03:59:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 03:59:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 03:59:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 03:59:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 03:59:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 03:59:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-20 03:59:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-20 03:59:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-20 03:59:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-20 03:59:35,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 03:59:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-20 03:59:35,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 03:59:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 03:59:35,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 03:59:35,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 03:59:35,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-20 03:59:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-20 03:59:35,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 03:59:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 03:59:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 03:59:35,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 03:59:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 03:59:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-20 03:59:35,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 03:59:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1403 trivial. 0 not checked. [2023-12-20 03:59:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 03:59:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450396671] [2023-12-20 03:59:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450396671] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 03:59:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 03:59:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-20 03:59:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21857688] [2023-12-20 03:59:35,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 03:59:35,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-20 03:59:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 03:59:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-20 03:59:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-20 03:59:35,484 INFO L87 Difference]: Start difference. First operand 232 states and 332 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2023-12-20 03:59:39,552 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 03:59:43,560 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 03:59:47,566 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 03:59:51,574 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 03:59:55,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 03:59:59,598 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:00,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:00:00,465 INFO L93 Difference]: Finished difference Result 518 states and 742 transitions. [2023-12-20 04:00:00,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 04:00:00,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2023-12-20 04:00:00,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:00:00,468 INFO L225 Difference]: With dead ends: 518 [2023-12-20 04:00:00,468 INFO L226 Difference]: Without dead ends: 327 [2023-12-20 04:00:00,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2023-12-20 04:00:00,470 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 188 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 133 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2023-12-20 04:00:00,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 641 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 601 Invalid, 6 Unknown, 0 Unchecked, 24.7s Time] [2023-12-20 04:00:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-12-20 04:00:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 319. [2023-12-20 04:00:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 201 states have (on average 1.2487562189054726) internal successors, (251), 206 states have internal predecessors, (251), 93 states have call successors, (93), 20 states have call predecessors, (93), 24 states have return successors, (112), 92 states have call predecessors, (112), 93 states have call successors, (112) [2023-12-20 04:00:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 456 transitions. [2023-12-20 04:00:00,524 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 456 transitions. Word has length 225 [2023-12-20 04:00:00,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:00:00,524 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 456 transitions. [2023-12-20 04:00:00,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2023-12-20 04:00:00,524 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 456 transitions. [2023-12-20 04:00:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-12-20 04:00:00,526 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:00:00,527 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:00:00,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 04:00:00,527 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:00:00,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:00:00,527 INFO L85 PathProgramCache]: Analyzing trace with hash -354795631, now seen corresponding path program 1 times [2023-12-20 04:00:00,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:00:00,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167869560] [2023-12-20 04:00:00,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:00,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:00:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:00:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:00:01,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:00:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:00:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:00:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:00:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 04:00:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:00:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 04:00:01,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 04:00:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 04:00:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 04:00:01,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-20 04:00:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-20 04:00:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-20 04:00:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-20 04:00:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 04:00:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-20 04:00:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 04:00:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 04:00:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 04:00:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 04:00:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-20 04:00:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-20 04:00:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 04:00:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 04:00:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 04:00:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 04:00:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 04:00:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-20 04:00:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:01,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2023-12-20 04:00:01,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:00:01,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167869560] [2023-12-20 04:00:01,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167869560] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:00:01,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366077096] [2023-12-20 04:00:01,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:00:01,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:00:01,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:00:01,414 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:01,414 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:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:00:02,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 1836 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-20 04:00:02,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:00:02,155 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:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 356 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2023-12-20 04:00:02,537 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:00:03,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2023-12-20 04:00:03,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366077096] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:00:03,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:00:03,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 31 [2023-12-20 04:00:03,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999216280] [2023-12-20 04:00:03,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:00:03,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-12-20 04:00:03,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:00:03,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-12-20 04:00:03,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2023-12-20 04:00:03,090 INFO L87 Difference]: Start difference. First operand 319 states and 456 transitions. Second operand has 31 states, 29 states have (on average 4.103448275862069) internal successors, (119), 24 states have internal predecessors, (119), 19 states have call successors, (72), 13 states have call predecessors, (72), 12 states have return successors, (72), 16 states have call predecessors, (72), 19 states have call successors, (72) [2023-12-20 04:00:07,232 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:11,246 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:15,250 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:19,264 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:23,277 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:27,287 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:31,301 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:35,313 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:39,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:00:43,335 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:47,347 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:51,360 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:55,366 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:59,371 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:03,377 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:07,385 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:11,397 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:15,402 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:19,407 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:23,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:01:27,435 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:31,448 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:35,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:01:35,997 INFO L93 Difference]: Finished difference Result 793 states and 1142 transitions. [2023-12-20 04:01:35,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-20 04:01:35,998 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 4.103448275862069) internal successors, (119), 24 states have internal predecessors, (119), 19 states have call successors, (72), 13 states have call predecessors, (72), 12 states have return successors, (72), 16 states have call predecessors, (72), 19 states have call successors, (72) Word has length 225 [2023-12-20 04:01:35,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:01:36,000 INFO L225 Difference]: With dead ends: 793 [2023-12-20 04:01:36,000 INFO L226 Difference]: Without dead ends: 501 [2023-12-20 04:01:36,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1097, Invalid=4453, Unknown=0, NotChecked=0, Total=5550 [2023-12-20 04:01:36,002 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 845 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 856 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 89.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 856 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.4s IncrementalHoareTripleChecker+Time [2023-12-20 04:01:36,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 754 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [856 Valid, 2131 Invalid, 22 Unknown, 0 Unchecked, 90.4s Time] [2023-12-20 04:01:36,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-12-20 04:01:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 400. [2023-12-20 04:01:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 259 states have (on average 1.2548262548262548) internal successors, (325), 265 states have internal predecessors, (325), 96 states have call successors, (96), 42 states have call predecessors, (96), 44 states have return successors, (130), 92 states have call predecessors, (130), 96 states have call successors, (130) [2023-12-20 04:01:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 551 transitions. [2023-12-20 04:01:36,043 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 551 transitions. Word has length 225 [2023-12-20 04:01:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:01:36,044 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 551 transitions. [2023-12-20 04:01:36,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 4.103448275862069) internal successors, (119), 24 states have internal predecessors, (119), 19 states have call successors, (72), 13 states have call predecessors, (72), 12 states have return successors, (72), 16 states have call predecessors, (72), 19 states have call successors, (72) [2023-12-20 04:01:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 551 transitions. [2023-12-20 04:01:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2023-12-20 04:01:36,047 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:01:36,047 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 9, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:01:36,059 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:36,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:01:36,257 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:01:36,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:01:36,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2118025875, now seen corresponding path program 1 times [2023-12-20 04:01:36,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:01:36,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978125141] [2023-12-20 04:01:36,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:36,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:01:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:01:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:01:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:01:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:01:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:01:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:01:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 04:01:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:01:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 04:01:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-20 04:01:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-20 04:01:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 04:01:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-20 04:01:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2023-12-20 04:01:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-12-20 04:01:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-12-20 04:01:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 04:01:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-20 04:01:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 04:01:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 04:01:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 04:01:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 04:01:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-20 04:01:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-20 04:01:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 04:01:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 04:01:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 04:01:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 04:01:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 04:01:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-20 04:01:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2023-12-20 04:01:39,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:01:39,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978125141] [2023-12-20 04:01:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978125141] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:01:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412136120] [2023-12-20 04:01:39,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:01:39,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:01:39,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:01:39,009 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:39,020 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:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:01:39,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 1922 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-20 04:01:39,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:01:39,834 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:50,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:01:50,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:01:50,593 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:52,007 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2023-12-20 04:01:52,008 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:02:14,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 392 proven. 4 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2023-12-20 04:02:14,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:02:15,120 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:02:15,124 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:02:15,459 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:02:15,462 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:02:15,514 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:02:15,525 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:02:15,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1403 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1399 trivial. 0 not checked. [2023-12-20 04:02:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412136120] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:02:15,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:02:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 9] total 39 [2023-12-20 04:02:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170540168] [2023-12-20 04:02:15,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:02:15,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-20 04:02:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:02:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-20 04:02:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1335, Unknown=6, NotChecked=0, Total=1482 [2023-12-20 04:02:15,591 INFO L87 Difference]: Start difference. First operand 400 states and 551 transitions. Second operand has 39 states, 36 states have (on average 3.75) internal successors, (135), 35 states have internal predecessors, (135), 19 states have call successors, (72), 13 states have call predecessors, (72), 14 states have return successors, (72), 17 states have call predecessors, (72), 19 states have call successors, (72) [2023-12-20 04:02:19,843 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:23,857 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 [0] [2023-12-20 04:02:27,867 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:31,872 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,885 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:39,891 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:43,894 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:47,905 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:51,912 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:55,919 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:59,929 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:03,941 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:07,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:11,973 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:15,985 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:19,994 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:24,007 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:28,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-20 04:03:32,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:36,058 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:40,068 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:44,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:03:48,093 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:52,103 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:56,108 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:04:00,112 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:04:04,118 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:04:08,131 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:12,138 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:04:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:04:17,514 INFO L93 Difference]: Finished difference Result 804 states and 1164 transitions. [2023-12-20 04:04:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-20 04:04:17,515 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 3.75) internal successors, (135), 35 states have internal predecessors, (135), 19 states have call successors, (72), 13 states have call predecessors, (72), 14 states have return successors, (72), 17 states have call predecessors, (72), 19 states have call successors, (72) Word has length 225 [2023-12-20 04:04:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:04:17,517 INFO L225 Difference]: With dead ends: 804 [2023-12-20 04:04:17,517 INFO L226 Difference]: Without dead ends: 463 [2023-12-20 04:04:17,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 492 SyntacticMatches, 7 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=901, Invalid=4793, Unknown=6, NotChecked=0, Total=5700 [2023-12-20 04:04:17,519 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 671 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 689 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 3590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119.0s IncrementalHoareTripleChecker+Time [2023-12-20 04:04:17,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 997 Invalid, 3590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [689 Valid, 2872 Invalid, 29 Unknown, 0 Unchecked, 119.0s Time] [2023-12-20 04:04:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-12-20 04:04:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 432. [2023-12-20 04:04:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 276 states have (on average 1.2536231884057971) internal successors, (346), 283 states have internal predecessors, (346), 108 states have call successors, (108), 42 states have call predecessors, (108), 47 states have return successors, (168), 106 states have call predecessors, (168), 108 states have call successors, (168) [2023-12-20 04:04:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 622 transitions. [2023-12-20 04:04:17,561 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 622 transitions. Word has length 225 [2023-12-20 04:04:17,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:04:17,561 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 622 transitions. [2023-12-20 04:04:17,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 3.75) internal successors, (135), 35 states have internal predecessors, (135), 19 states have call successors, (72), 13 states have call predecessors, (72), 14 states have return successors, (72), 17 states have call predecessors, (72), 19 states have call successors, (72) [2023-12-20 04:04:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 622 transitions. [2023-12-20 04:04:17,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2023-12-20 04:04:17,564 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:04:17,564 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:04:17,573 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:04:17,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:04:17,773 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:04:17,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:04:17,774 INFO L85 PathProgramCache]: Analyzing trace with hash 465482974, now seen corresponding path program 1 times [2023-12-20 04:04:17,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:04:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24468258] [2023-12-20 04:04:17,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:04:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:04:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:04:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:04:19,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:04:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 04:04:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 04:04:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:04:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:04:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:04:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:04:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:04:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 04:04:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:04:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-12-20 04:04:19,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-12-20 04:04:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 04:04:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-12-20 04:04:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2023-12-20 04:04:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-12-20 04:04:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-12-20 04:04:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2023-12-20 04:04:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2023-12-20 04:04:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-12-20 04:04:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2023-12-20 04:04:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2023-12-20 04:04:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2023-12-20 04:04:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-12-20 04:04:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-12-20 04:04:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-12-20 04:04:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-12-20 04:04:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-20 04:04:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2023-12-20 04:04:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-12-20 04:04:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-12-20 04:04:19,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-12-20 04:04:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:19,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 1792 trivial. 0 not checked. [2023-12-20 04:04:19,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:04:19,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24468258] [2023-12-20 04:04:19,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24468258] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:04:19,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706651865] [2023-12-20 04:04:19,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:04:19,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:04:19,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:04:19,575 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:04:19,629 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:04:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:04:20,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 2384 conjuncts, 75 conjunts are in the unsatisfiable core [2023-12-20 04:04:20,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:04:20,584 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:04:20,590 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:04:20,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:04:20,652 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:04:20,813 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:04:20,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:04:20,896 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:04:20,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:04:20,962 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:04:21,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 390 proven. 12 refuted. 0 times theorem prover too weak. 1412 trivial. 0 not checked. [2023-12-20 04:04:21,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:04:21,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2023-12-20 04:04:21,984 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 36 treesize of output 28 [2023-12-20 04:04:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1814 backedges. 16 proven. 39 refuted. 0 times theorem prover too weak. 1759 trivial. 0 not checked. [2023-12-20 04:04:22,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706651865] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:04:22,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:04:22,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 17] total 39 [2023-12-20 04:04:22,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777708574] [2023-12-20 04:04:22,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:04:22,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-12-20 04:04:22,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:04:22,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-12-20 04:04:22,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2023-12-20 04:04:22,161 INFO L87 Difference]: Start difference. First operand 432 states and 622 transitions. Second operand has 39 states, 36 states have (on average 4.861111111111111) internal successors, (175), 34 states have internal predecessors, (175), 25 states have call successors, (91), 15 states have call predecessors, (91), 14 states have return successors, (91), 21 states have call predecessors, (91), 25 states have call successors, (91) [2023-12-20 04:04:26,369 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,381 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:34,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:39,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:43,033 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:44,119 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:04:48,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:51,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:55,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:04:57,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:01,141 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:05:05,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:09,168 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:05:13,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:05:17,556 INFO L93 Difference]: Finished difference Result 864 states and 1236 transitions. [2023-12-20 04:05:17,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-20 04:05:17,556 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 4.861111111111111) internal successors, (175), 34 states have internal predecessors, (175), 25 states have call successors, (91), 15 states have call predecessors, (91), 14 states have return successors, (91), 21 states have call predecessors, (91), 25 states have call successors, (91) Word has length 273 [2023-12-20 04:05:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:05:17,558 INFO L225 Difference]: With dead ends: 864 [2023-12-20 04:05:17,558 INFO L226 Difference]: Without dead ends: 474 [2023-12-20 04:05:17,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 690 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1028, Invalid=4228, Unknown=0, NotChecked=0, Total=5256 [2023-12-20 04:05:17,561 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 874 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 1108 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 4070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1108 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 53.7s IncrementalHoareTripleChecker+Time [2023-12-20 04:05:17,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1023 Invalid, 4070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1108 Valid, 2951 Invalid, 11 Unknown, 0 Unchecked, 53.7s Time] [2023-12-20 04:05:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-12-20 04:05:17,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 384. [2023-12-20 04:05:17,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 246 states have (on average 1.2235772357723578) internal successors, (301), 248 states have internal predecessors, (301), 94 states have call successors, (94), 36 states have call predecessors, (94), 43 states have return successors, (121), 99 states have call predecessors, (121), 94 states have call successors, (121) [2023-12-20 04:05:17,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 516 transitions. [2023-12-20 04:05:17,601 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 516 transitions. Word has length 273 [2023-12-20 04:05:17,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:05:17,602 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 516 transitions. [2023-12-20 04:05:17,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 4.861111111111111) internal successors, (175), 34 states have internal predecessors, (175), 25 states have call successors, (91), 15 states have call predecessors, (91), 14 states have return successors, (91), 21 states have call predecessors, (91), 25 states have call successors, (91) [2023-12-20 04:05:17,602 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 516 transitions. [2023-12-20 04:05:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-20 04:05:17,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:05:17,604 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 5, 5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:05:17,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-20 04:05:17,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:05:17,815 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:05:17,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:05:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash 224116631, now seen corresponding path program 1 times [2023-12-20 04:05:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:05:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034572794] [2023-12-20 04:05:17,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:05:17,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:05:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:05:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:05:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:05:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:05:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:05:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:05:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:18,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 04:05:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 04:05:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-20 04:05:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-20 04:05:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-20 04:05:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 04:05:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 04:05:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 04:05:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 04:05:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 04:05:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 04:05:18,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 04:05:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 04:05:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-20 04:05:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-20 04:05:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-12-20 04:05:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-20 04:05:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 04:05:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-12-20 04:05:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-12-20 04:05:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-20 04:05:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-20 04:05:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-20 04:05:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:18,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2023-12-20 04:05:18,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:05:18,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034572794] [2023-12-20 04:05:18,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034572794] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:05:18,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069589039] [2023-12-20 04:05:18,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:18,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:05:18,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:05:18,284 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:05:18,306 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:05:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:19,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-20 04:05:19,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:05:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 1213 trivial. 0 not checked. [2023-12-20 04:05:19,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-20 04:05:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069589039] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:05:19,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-20 04:05:19,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-12-20 04:05:19,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440304348] [2023-12-20 04:05:19,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:05:19,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 04:05:19,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:05:19,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 04:05:19,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-20 04:05:19,129 INFO L87 Difference]: Start difference. First operand 384 states and 516 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-20 04:05:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:05:19,205 INFO L93 Difference]: Finished difference Result 691 states and 970 transitions. [2023-12-20 04:05:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 04:05:19,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 244 [2023-12-20 04:05:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:05:19,207 INFO L225 Difference]: With dead ends: 691 [2023-12-20 04:05:19,207 INFO L226 Difference]: Without dead ends: 389 [2023-12-20 04:05:19,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 317 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:05:19,209 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 04:05:19,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 04:05:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-20 04:05:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 388. [2023-12-20 04:05:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 250 states have (on average 1.22) internal successors, (305), 252 states have internal predecessors, (305), 94 states have call successors, (94), 36 states have call predecessors, (94), 43 states have return successors, (121), 99 states have call predecessors, (121), 94 states have call successors, (121) [2023-12-20 04:05:19,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 520 transitions. [2023-12-20 04:05:19,248 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 520 transitions. Word has length 244 [2023-12-20 04:05:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:05:19,248 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 520 transitions. [2023-12-20 04:05:19,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2023-12-20 04:05:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 520 transitions. [2023-12-20 04:05:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-12-20 04:05:19,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:05:19,250 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 27, 9, 5, 5, 5, 5, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:05:19,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-20 04:05:19,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:05:19,478 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:05:19,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:05:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 243657753, now seen corresponding path program 1 times [2023-12-20 04:05:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:05:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153395237] [2023-12-20 04:05:19,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:05:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:05:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:05:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:05:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:05:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:05:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:05:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:05:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 04:05:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:20,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-20 04:05:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-20 04:05:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2023-12-20 04:05:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-12-20 04:05:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-12-20 04:05:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 04:05:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 04:05:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-12-20 04:05:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-12-20 04:05:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-12-20 04:05:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-12-20 04:05:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2023-12-20 04:05:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2023-12-20 04:05:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2023-12-20 04:05:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-12-20 04:05:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-12-20 04:05:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2023-12-20 04:05:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-12-20 04:05:21,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-12-20 04:05:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-12-20 04:05:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-12-20 04:05:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-12-20 04:05:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1528 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-12-20 04:05:21,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:05:21,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153395237] [2023-12-20 04:05:21,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153395237] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 04:05:21,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 04:05:21,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-20 04:05:21,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046121891] [2023-12-20 04:05:21,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 04:05:21,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-20 04:05:21,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:05:21,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-20 04:05:21,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-12-20 04:05:21,071 INFO L87 Difference]: Start difference. First operand 388 states and 520 transitions. Second operand has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34) [2023-12-20 04:05:25,133 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:05:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:05:26,850 INFO L93 Difference]: Finished difference Result 1089 states and 1480 transitions. [2023-12-20 04:05:26,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-20 04:05:26,850 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34) Word has length 244 [2023-12-20 04:05:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:05:26,854 INFO L225 Difference]: With dead ends: 1089 [2023-12-20 04:05:26,854 INFO L226 Difference]: Without dead ends: 759 [2023-12-20 04:05:26,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=217, Invalid=485, Unknown=0, NotChecked=0, Total=702 [2023-12-20 04:05:26,855 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 580 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 578 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-20 04:05:26,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 406 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 790 Invalid, 1 Unknown, 0 Unchecked, 5.1s Time] [2023-12-20 04:05:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2023-12-20 04:05:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 502. [2023-12-20 04:05:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 319 states have (on average 1.1724137931034482) internal successors, (374), 320 states have internal predecessors, (374), 125 states have call successors, (125), 42 states have call predecessors, (125), 57 states have return successors, (169), 139 states have call predecessors, (169), 125 states have call successors, (169) [2023-12-20 04:05:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 668 transitions. [2023-12-20 04:05:26,926 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 668 transitions. Word has length 244 [2023-12-20 04:05:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:05:26,927 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 668 transitions. [2023-12-20 04:05:26,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (34), 5 states have call predecessors, (34), 3 states have return successors, (34), 6 states have call predecessors, (34), 5 states have call successors, (34) [2023-12-20 04:05:26,928 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 668 transitions. [2023-12-20 04:05:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2023-12-20 04:05:26,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:05:26,930 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 6, 6, 6, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:05:26,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-20 04:05:26,930 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:05:26,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:05:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash -117133428, now seen corresponding path program 1 times [2023-12-20 04:05:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:05:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986401714] [2023-12-20 04:05:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:05:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:28,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:05:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:05:29,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:05:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-20 04:05:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:05:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:05:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:05:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:05:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:05:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-20 04:05:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:05:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-12-20 04:05:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 04:05:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 04:05:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-12-20 04:05:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-12-20 04:05:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-12-20 04:05:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-20 04:05:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2023-12-20 04:05:29,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-12-20 04:05:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2023-12-20 04:05:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-12-20 04:05:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-12-20 04:05:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-12-20 04:05:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-12-20 04:05:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-12-20 04:05:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2023-12-20 04:05:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-12-20 04:05:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2023-12-20 04:05:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-12-20 04:05:29,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-12-20 04:05:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-12-20 04:05:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-12-20 04:05:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1668 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 1651 trivial. 0 not checked. [2023-12-20 04:05:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:05:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986401714] [2023-12-20 04:05:29,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986401714] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:05:29,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320126426] [2023-12-20 04:05:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:05:29,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:05:29,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:05:29,781 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:05:29,805 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:05:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:05:30,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 2177 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-20 04:05:30,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:05:30,886 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:05:31,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:05:31,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:05:31,004 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 25 treesize of output 15 [2023-12-20 04:05:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1668 backedges. 627 proven. 4 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2023-12-20 04:05:31,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 04:05:31,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1668 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2023-12-20 04:05:31,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320126426] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 04:05:31,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 04:05:31,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 7] total 44 [2023-12-20 04:05:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209966056] [2023-12-20 04:05:31,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 04:05:31,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-20 04:05:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 04:05:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-20 04:05:31,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2023-12-20 04:05:31,800 INFO L87 Difference]: Start difference. First operand 502 states and 668 transitions. Second operand has 44 states, 41 states have (on average 4.121951219512195) internal successors, (169), 40 states have internal predecessors, (169), 22 states have call successors, (80), 12 states have call predecessors, (80), 18 states have return successors, (82), 20 states have call predecessors, (82), 22 states have call successors, (82) [2023-12-20 04:05:36,178 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:05:40,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:44,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:05:48,217 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:05:52,226 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:05:56,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:06:00,250 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:06:04,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:06:08,278 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:06:12,291 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:06:16,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:06:20,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:06:25,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-20 04:06:29,055 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:06:33,059 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:06:37,067 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:06:41,073 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:06:45,078 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:06:49,089 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:06:53,097 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:06:57,105 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:07:01,114 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:07:05,125 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:07:09,138 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:07:13,143 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:07:17,148 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:07:21,155 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:07:25,161 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:07:29,172 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:07:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 04:07:32,636 INFO L93 Difference]: Finished difference Result 742 states and 996 transitions. [2023-12-20 04:07:32,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-20 04:07:32,637 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 4.121951219512195) internal successors, (169), 40 states have internal predecessors, (169), 22 states have call successors, (80), 12 states have call predecessors, (80), 18 states have return successors, (82), 20 states have call predecessors, (82), 22 states have call successors, (82) Word has length 257 [2023-12-20 04:07:32,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 04:07:32,649 INFO L225 Difference]: With dead ends: 742 [2023-12-20 04:07:32,649 INFO L226 Difference]: Without dead ends: 508 [2023-12-20 04:07:32,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 577 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=915, Invalid=5405, Unknown=0, NotChecked=0, Total=6320 [2023-12-20 04:07:32,653 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 550 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 3865 mSolverCounterSat, 562 mSolverCounterUnsat, 29 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 4456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 3865 IncrementalHoareTripleChecker+Invalid, 29 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 119.2s IncrementalHoareTripleChecker+Time [2023-12-20 04:07:32,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1796 Invalid, 4456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 3865 Invalid, 29 Unknown, 0 Unchecked, 119.2s Time] [2023-12-20 04:07:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2023-12-20 04:07:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 500. [2023-12-20 04:07:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 317 states have (on average 1.167192429022082) internal successors, (370), 318 states have internal predecessors, (370), 125 states have call successors, (125), 42 states have call predecessors, (125), 57 states have return successors, (168), 139 states have call predecessors, (168), 125 states have call successors, (168) [2023-12-20 04:07:32,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 663 transitions. [2023-12-20 04:07:32,756 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 663 transitions. Word has length 257 [2023-12-20 04:07:32,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 04:07:32,756 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 663 transitions. [2023-12-20 04:07:32,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 4.121951219512195) internal successors, (169), 40 states have internal predecessors, (169), 22 states have call successors, (80), 12 states have call predecessors, (80), 18 states have return successors, (82), 20 states have call predecessors, (82), 22 states have call successors, (82) [2023-12-20 04:07:32,756 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 663 transitions. [2023-12-20 04:07:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-12-20 04:07:32,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 04:07:32,758 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 9, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 04:07:32,771 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:07:32,969 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:07:32,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 04:07:32,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 04:07:32,970 INFO L85 PathProgramCache]: Analyzing trace with hash -821994140, now seen corresponding path program 1 times [2023-12-20 04:07:32,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 04:07:32,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001751567] [2023-12-20 04:07:32,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:07:32,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 04:07:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:45,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-20 04:07:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:49,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:49,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-20 04:07:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:49,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-20 04:07:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-20 04:07:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:50,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-20 04:07:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:50,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:50,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-20 04:07:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:51,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 04:07:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:51,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 04:07:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:51,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:51,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-20 04:07:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-20 04:07:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-12-20 04:07:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-20 04:07:52,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-12-20 04:07:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2023-12-20 04:07:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2023-12-20 04:07:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2023-12-20 04:07:52,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-12-20 04:07:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2023-12-20 04:07:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-12-20 04:07:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-12-20 04:07:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2023-12-20 04:07:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2023-12-20 04:07:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2023-12-20 04:07:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2023-12-20 04:07:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-12-20 04:07:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-12-20 04:07:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-12-20 04:07:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-12-20 04:07:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-12-20 04:07:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2023-12-20 04:07:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-12-20 04:07:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-12-20 04:07:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1666 backedges. 48 proven. 338 refuted. 0 times theorem prover too weak. 1280 trivial. 0 not checked. [2023-12-20 04:07:52,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 04:07:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001751567] [2023-12-20 04:07:52,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001751567] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 04:07:52,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298254108] [2023-12-20 04:07:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 04:07:52,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 04:07:52,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 04:07:52,135 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:07:52,136 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:07:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 04:07:59,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 2215 conjuncts, 256 conjunts are in the unsatisfiable core [2023-12-20 04:07:59,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 04:07:59,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-12-20 04:07:59,839 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:07:59,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2023-12-20 04:08:00,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:08:00,133 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:08:00,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-20 04:08:00,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 39 [2023-12-20 04:08:00,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-12-20 04:08:00,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-20 04:08:01,393 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:08:01,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-20 04:08:03,052 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-20 04:08:03,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2023-12-20 04:08:03,058 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 18 treesize of output 16 [2023-12-20 04:08:03,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-12-20 04:08:03,621 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-12-20 04:08:03,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 122 treesize of output 112 [2023-12-20 04:08:03,636 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 100 treesize of output 86 [2023-12-20 04:08:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:04,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-20 04:08:04,512 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 55 treesize of output 50 [2023-12-20 04:08:04,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:04,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:04,537 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-20 04:08:04,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 60 [2023-12-20 04:08:09,547 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-20 04:08:09,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-12-20 04:08:12,174 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 55 treesize of output 50 [2023-12-20 04:08:12,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:12,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:12,220 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-20 04:08:12,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 60 [2023-12-20 04:08:12,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:12,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-20 04:08:27,133 WARN L293 SmtUtils]: Spent 7.13s on a formula simplification that was a NOOP. DAG size: 129 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 04:08:27,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:27,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-20 04:08:27,519 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 55 treesize of output 50 [2023-12-20 04:08:27,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:27,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-20 04:08:27,573 INFO L349 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-12-20 04:08:27,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 60 [2023-12-20 04:09:00,520 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:09:00,521 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-12-20 04:09:00,539 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:09:00,576 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:09:00,721 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,SelfDestructingSolverStorable12 [2023-12-20 04:09:00,722 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.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:950) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:789) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:377) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:579) 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) ... 46 more [2023-12-20 04:09:00,726 INFO L158 Benchmark]: Toolchain (without parser) took 601953.74ms. Allocated memory was 202.4MB in the beginning and 1.2GB in the end (delta: 982.5MB). Free memory was 136.6MB in the beginning and 771.5MB in the end (delta: -635.0MB). Peak memory consumption was 348.1MB. Max. memory is 8.0GB. [2023-12-20 04:09:00,726 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 04:09:00,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.20ms. Allocated memory is still 202.4MB. Free memory was 136.1MB in the beginning and 106.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-20 04:09:00,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.85ms. Allocated memory is still 202.4MB. Free memory was 106.7MB in the beginning and 101.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-20 04:09:00,727 INFO L158 Benchmark]: Boogie Preprocessor took 107.54ms. Allocated memory is still 202.4MB. Free memory was 101.4MB in the beginning and 93.5MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-20 04:09:00,727 INFO L158 Benchmark]: RCFGBuilder took 4754.56ms. Allocated memory was 202.4MB in the beginning and 273.7MB in the end (delta: 71.3MB). Free memory was 93.5MB in the beginning and 196.8MB in the end (delta: -103.3MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. [2023-12-20 04:09:00,727 INFO L158 Benchmark]: TraceAbstraction took 596491.29ms. Allocated memory was 273.7MB in the beginning and 1.2GB in the end (delta: 911.2MB). Free memory was 196.3MB in the beginning and 771.5MB in the end (delta: -575.3MB). Peak memory consumption was 335.4MB. Max. memory is 8.0GB. [2023-12-20 04:09:00,728 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 202.4MB. Free memory is still 151.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 541.20ms. Allocated memory is still 202.4MB. Free memory was 136.1MB in the beginning and 106.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.85ms. Allocated memory is still 202.4MB. Free memory was 106.7MB in the beginning and 101.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 107.54ms. Allocated memory is still 202.4MB. Free memory was 101.4MB in the beginning and 93.5MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 4754.56ms. Allocated memory was 202.4MB in the beginning and 273.7MB in the end (delta: 71.3MB). Free memory was 93.5MB in the beginning and 196.8MB in the end (delta: -103.3MB). Peak memory consumption was 32.6MB. Max. memory is 8.0GB. * TraceAbstraction took 596491.29ms. Allocated memory was 273.7MB in the beginning and 1.2GB in the end (delta: 911.2MB). Free memory was 196.3MB in the beginning and 771.5MB in the end (delta: -575.3MB). Peak memory consumption was 335.4MB. 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...