/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-d6e1636 [2023-01-10 13:19:34,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-10 13:19:34,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-10 13:19:34,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-10 13:19:34,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-10 13:19:34,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-10 13:19:34,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-10 13:19:34,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-10 13:19:34,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-10 13:19:34,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-10 13:19:34,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-10 13:19:34,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-10 13:19:34,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-10 13:19:34,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-10 13:19:34,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-10 13:19:34,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-10 13:19:34,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-10 13:19:34,622 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-10 13:19:34,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-10 13:19:34,627 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-10 13:19:34,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-10 13:19:34,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-10 13:19:34,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-10 13:19:34,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-10 13:19:34,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-10 13:19:34,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-10 13:19:34,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-10 13:19:34,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-10 13:19:34,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-10 13:19:34,637 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-10 13:19:34,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-10 13:19:34,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-10 13:19:34,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-10 13:19:34,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-10 13:19:34,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-10 13:19:34,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-10 13:19:34,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-10 13:19:34,640 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-10 13:19:34,640 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-10 13:19:34,641 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-10 13:19:34,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-10 13:19:34,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2023-01-10 13:19:34,665 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-10 13:19:34,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-10 13:19:34,665 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-10 13:19:34,666 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-10 13:19:34,666 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-10 13:19:34,667 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-10 13:19:34,667 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-10 13:19:34,667 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-10 13:19:34,667 INFO L138 SettingsManager]: * Use SBE=true [2023-01-10 13:19:34,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-10 13:19:34,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-10 13:19:34,669 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-10 13:19:34,669 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-10 13:19:34,669 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-10 13:19:34,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-10 13:19:34,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 13:19:34,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-10 13:19:34,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-10 13:19:34,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-10 13:19:34,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-10 13:19:34,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-10 13:19:34,670 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-10 13:19:34,670 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-10 13:19:34,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-10 13:19:34,670 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-10 13:19:34,670 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-01-10 13:19:34,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-10 13:19:34,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-10 13:19:34,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-10 13:19:34,856 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-10 13:19:34,856 INFO L275 PluginConnector]: CDTParser initialized [2023-01-10 13:19:34,857 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-01-10 13:19:35,754 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-10 13:19:35,896 INFO L351 CDTParser]: Found 1 translation units. [2023-01-10 13:19:35,896 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-01-10 13:19:35,901 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf395612/e6bada94cc91489b9138c935fbd64c00/FLAG52c0d2a7f [2023-01-10 13:19:35,911 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8bf395612/e6bada94cc91489b9138c935fbd64c00 [2023-01-10 13:19:35,913 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-10 13:19:35,914 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-10 13:19:35,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-10 13:19:35,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-10 13:19:35,920 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-10 13:19:35,921 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:19:35" (1/1) ... [2023-01-10 13:19:35,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1c6641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:35, skipping insertion in model container [2023-01-10 13:19:35,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:19:35" (1/1) ... [2023-01-10 13:19:35,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-10 13:19:35,946 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-10 13:19:36,104 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2023-01-10 13:19:36,111 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 13:19:36,120 INFO L203 MainTranslator]: Completed pre-run [2023-01-10 13:19:36,154 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2023-01-10 13:19:36,156 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-10 13:19:36,168 WARN L663 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 13:19:36,168 WARN L663 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-10 13:19:36,172 INFO L208 MainTranslator]: Completed translation [2023-01-10 13:19:36,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36 WrapperNode [2023-01-10 13:19:36,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-10 13:19:36,174 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-10 13:19:36,174 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-10 13:19:36,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-10 13:19:36,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,194 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,231 INFO L138 Inliner]: procedures = 29, calls = 88, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 403 [2023-01-10 13:19:36,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-10 13:19:36,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-10 13:19:36,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-10 13:19:36,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-10 13:19:36,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,242 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,273 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-10 13:19:36,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-10 13:19:36,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-10 13:19:36,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-10 13:19:36,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (1/1) ... [2023-01-10 13:19:36,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-10 13:19:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:36,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-10 13:19:36,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-10 13:19:36,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-10 13:19:36,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-10 13:19:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-10 13:19:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-10 13:19:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-10 13:19:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-10 13:19:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-10 13:19:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-10 13:19:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-10 13:19:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-10 13:19:36,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-10 13:19:36,362 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-01-10 13:19:36,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-01-10 13:19:36,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-10 13:19:36,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-10 13:19:36,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-10 13:19:36,364 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-10 13:19:36,470 INFO L236 CfgBuilder]: Building ICFG [2023-01-10 13:19:36,474 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-10 13:19:36,871 INFO L277 CfgBuilder]: Performing block encoding [2023-01-10 13:19:37,040 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-10 13:19:37,040 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-10 13:19:37,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:19:37 BoogieIcfgContainer [2023-01-10 13:19:37,042 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-10 13:19:37,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-10 13:19:37,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-10 13:19:37,046 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-10 13:19:37,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:19:35" (1/3) ... [2023-01-10 13:19:37,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fa7030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:19:37, skipping insertion in model container [2023-01-10 13:19:37,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:19:36" (2/3) ... [2023-01-10 13:19:37,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13fa7030 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:19:37, skipping insertion in model container [2023-01-10 13:19:37,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:19:37" (3/3) ... [2023-01-10 13:19:37,048 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2023-01-10 13:19:37,053 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-10 13:19:37,059 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-10 13:19:37,059 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-10 13:19:37,059 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-10 13:19:37,163 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-01-10 13:19:37,209 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:37,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 13:19:37,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:37,212 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 13:19:37,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-01-10 13:19:37,249 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 13:19:37,260 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 13:19:37,265 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@697a482a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:37,265 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 13:19:37,268 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 13:19:37,272 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 13:19:37,277 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 13:19:37,279 INFO L307 ceAbstractionStarter]: Result for error location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/11) [2023-01-10 13:19:37,289 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:37,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 13:19:37,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:37,322 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 13:19:37,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2023-01-10 13:19:37,326 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 13:19:37,326 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2023-01-10 13:19:37,327 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@697a482a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:37,327 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 13:19:37,327 WARN L125 DepthFirstTraversal]: Depth first traversal did not find any initial state. Returning directly. [2023-01-10 13:19:37,328 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-01-10 13:19:37,329 INFO L445 BasicCegarLoop]: Path program histogram: [] [2023-01-10 13:19:37,329 INFO L307 ceAbstractionStarter]: Result for error location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/11) [2023-01-10 13:19:37,333 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:37,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-10 13:19:37,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:37,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-10 13:19:37,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2023-01-10 13:19:37,339 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-01-10 13:19:37,339 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-10 13:19:37,340 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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@697a482a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-10 13:19:37,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-10 13:19:37,499 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:37,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:37,503 INFO L85 PathProgramCache]: Analyzing trace with hash -807479840, now seen corresponding path program 1 times [2023-01-10 13:19:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:37,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505801781] [2023-01-10 13:19:37,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 13:19:37,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:37,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505801781] [2023-01-10 13:19:37,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505801781] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:19:37,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:19:37,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-10 13:19:37,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902538053] [2023-01-10 13:19:37,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:37,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-10 13:19:37,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-10 13:19:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-10 13:19:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:37,874 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:37,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:19:37,874 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:38,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-10 13:19:38,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:38,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:38,034 INFO L85 PathProgramCache]: Analyzing trace with hash -568511521, now seen corresponding path program 1 times [2023-01-10 13:19:38,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:38,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845666854] [2023-01-10 13:19:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:38,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 13:19:38,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:38,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845666854] [2023-01-10 13:19:38,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845666854] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:19:38,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:19:38,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-01-10 13:19:38,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741805860] [2023-01-10 13:19:38,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:38,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-10 13:19:38,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:38,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-10 13:19:38,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-01-10 13:19:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:38,885 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:38,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.583333333333332) internal successors, (211), 12 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:19:38,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:38,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:39,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:19:39,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-10 13:19:39,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:39,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:39,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1228209084, now seen corresponding path program 1 times [2023-01-10 13:19:39,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:39,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54575705] [2023-01-10 13:19:39,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:39,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-10 13:19:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54575705] [2023-01-10 13:19:40,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54575705] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-10 13:19:40,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-10 13:19:40,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-01-10 13:19:40,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845224852] [2023-01-10 13:19:40,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-10 13:19:40,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-01-10 13:19:40,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:40,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-01-10 13:19:40,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-01-10 13:19:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:40,348 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:40,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.9) internal successors, (219), 10 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:19:40,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:40,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:19:40,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:19:40,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-10 13:19:40,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-10 13:19:40,805 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash -667348022, now seen corresponding path program 1 times [2023-01-10 13:19:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:40,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628597100] [2023-01-10 13:19:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:40,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 13:19:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:41,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628597100] [2023-01-10 13:19:41,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628597100] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:41,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947579905] [2023-01-10 13:19:41,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:41,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:19:41,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:41,404 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-01-10 13:19:41,405 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-01-10 13:19:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:41,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 617 conjuncts, 16 conjunts are in the unsatisfiable core [2023-01-10 13:19:41,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:19:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-10 13:19:41,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:19:42,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-10 13:19:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947579905] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:19:42,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:19:42,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2023-01-10 13:19:42,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552240454] [2023-01-10 13:19:42,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:19:42,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-10 13:19:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:19:42,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-10 13:19:42,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2023-01-10 13:19:42,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:42,179 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:19:42,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 16.517241379310345) internal successors, (479), 29 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:19:42,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:42,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:19:42,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-01-10 13:19:42,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:19:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:19:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-10 13:19:46,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-01-10 13:19:46,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-10 13:19:46,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:19:46,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:19:46,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:19:46,295 INFO L85 PathProgramCache]: Analyzing trace with hash 135283585, now seen corresponding path program 1 times [2023-01-10 13:19:46,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:19:46,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842032497] [2023-01-10 13:19:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:46,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:19:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:48,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-10 13:19:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:19:48,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842032497] [2023-01-10 13:19:48,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842032497] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:19:48,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134789746] [2023-01-10 13:19:48,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:19:48,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:19:48,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:19:48,459 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-01-10 13:19:48,464 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-01-10 13:19:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:19:48,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 119 conjunts are in the unsatisfiable core [2023-01-10 13:19:48,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:19:48,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 13:19:48,693 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-10 13:19:48,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-01-10 13:19:48,976 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-01-10 13:19:48,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-01-10 13:19:49,309 INFO L350 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 15 treesize of output 11 [2023-01-10 13:19:49,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 13:19:49,997 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-10 13:19:50,263 INFO L350 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 6 treesize of output 5 [2023-01-10 13:19:50,391 INFO L350 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 6 treesize of output 5 [2023-01-10 13:19:51,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:19:51,159 INFO L350 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 23 treesize of output 25 [2023-01-10 13:19:51,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:19:51,278 INFO L350 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 23 treesize of output 25 [2023-01-10 13:19:51,471 INFO L321 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-01-10 13:19:51,472 INFO L350 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 28 treesize of output 14 [2023-01-10 13:19:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 13:19:51,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:19:58,575 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:19:58,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 62 [2023-01-10 13:19:58,954 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-01-10 13:19:58,970 INFO L350 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 422051830 treesize of output 413663226 [2023-01-10 13:20:00,536 INFO L350 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 1558 treesize of output 1462 [2023-01-10 13:20:00,562 INFO L350 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 1462 treesize of output 1270 [2023-01-10 13:20:00,586 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-01-10 13:20:00,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1270 treesize of output 1098 [2023-01-10 13:20:00,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:20:00,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 491 treesize of output 467 [2023-01-10 13:20:00,763 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-01-10 13:20:00,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 982 treesize of output 898 [2023-01-10 13:20:00,847 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-01-10 13:20:00,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 458 treesize of output 419 [2023-01-10 13:20:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 13:20:01,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134789746] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:20:01,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:20:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 41, 38] total 90 [2023-01-10 13:20:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553507191] [2023-01-10 13:20:01,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:20:01,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 90 states [2023-01-10 13:20:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:20:01,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2023-01-10 13:20:01,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=7325, Unknown=107, NotChecked=0, Total=8010 [2023-01-10 13:20:01,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:20:01,919 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:20:01,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 90 states, 90 states have (on average 7.044444444444444) internal successors, (634), 90 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:20:01,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:20:01,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:20:01,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-01-10 13:20:01,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-01-10 13:20:01,920 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:20:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:20:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:20:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-10 13:20:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-01-10 13:20:13,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2023-01-10 13:20:13,605 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-01-10 13:20:13,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:20:13,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:20:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:20:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1273219672, now seen corresponding path program 2 times [2023-01-10 13:20:13,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:20:13,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548122599] [2023-01-10 13:20:13,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:20:13,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:20:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:20:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-10 13:20:14,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:20:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548122599] [2023-01-10 13:20:14,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548122599] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:20:14,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548101303] [2023-01-10 13:20:14,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-10 13:20:14,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:20:14,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:20:14,394 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-01-10 13:20:14,396 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-01-10 13:20:14,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-10 13:20:14,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:20:14,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 18 conjunts are in the unsatisfiable core [2023-01-10 13:20:14,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:20:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-01-10 13:20:15,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:20:15,370 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-01-10 13:20:15,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548101303] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-10 13:20:15,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-10 13:20:15,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 36 [2023-01-10 13:20:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020116443] [2023-01-10 13:20:15,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-10 13:20:15,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-10 13:20:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-10 13:20:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-10 13:20:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2023-01-10 13:20:15,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:20:15,374 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-10 13:20:15,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 13.694444444444445) internal successors, (493), 36 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-10 13:20:15,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:20:15,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:20:15,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-01-10 13:20:15,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2023-01-10 13:20:15,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2023-01-10 13:20:15,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:21:59,801 WARN L222 SmtUtils]: Spent 1.68m on a formula simplification. DAG size of input: 202 DAG size of output: 186 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:22:01,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:03,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:06,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:08,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:10,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:26,665 WARN L222 SmtUtils]: Spent 11.21s on a formula simplification. DAG size of input: 127 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:22:30,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:52,965 WARN L222 SmtUtils]: Spent 16.54s on a formula simplification. DAG size of input: 120 DAG size of output: 111 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:22:54,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:56,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:22:59,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:00,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:03,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:05,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:07,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:09,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:11,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:14,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:17,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:19,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:21,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:23,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:25,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:27,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:30,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:32,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:33,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:36,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:38,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:40,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:44,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:23:46,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:03,858 WARN L222 SmtUtils]: Spent 10.58s on a formula simplification. DAG size of input: 120 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:24:06,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:08,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:12,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:24,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:25,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:27,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:39,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:41,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:24:43,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:02,723 WARN L222 SmtUtils]: Spent 7.62s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:25:05,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:07,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:24,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:44,273 WARN L222 SmtUtils]: Spent 7.41s on a formula simplification that was a NOOP. DAG size: 91 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:25:47,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:49,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:51,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:53,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:56,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:25:59,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:26:00,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:26:03,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:26:10,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:26:20,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:26:23,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:26:34,564 WARN L222 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 86 DAG size of output: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:26:48,631 WARN L222 SmtUtils]: Spent 9.19s on a formula simplification. DAG size of input: 93 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:27:00,330 WARN L222 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 87 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:27:10,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:17,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:19,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:22,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:24,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:27,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:29,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:32,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:35,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:38,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:40,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:42,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:45,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:47,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:49,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:52,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:54,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:27:55,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:28:24,448 WARN L222 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 110 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:28:26,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:28:29,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:28:31,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:28:56,601 WARN L222 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:29:00,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:02,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:05,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:07,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:10,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:12,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:49,302 WARN L222 SmtUtils]: Spent 26.06s on a formula simplification. DAG size of input: 111 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:29:50,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:51,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:53,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:56,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:29:59,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:01,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:03,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:05,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:07,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:09,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:11,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:14,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:16,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:18,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:20,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:22,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:24,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:26,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:28,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:30,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:32,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:34,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:37,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:39,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:41,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:44,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:46,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:49,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:30:51,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-10 13:31:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-10 13:31:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-10 13:31:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-10 13:31:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-01-10 13:31:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2023-01-10 13:31:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-01-10 13:31:09,355 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-01-10 13:31:09,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:31:09,550 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-10 13:31:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-10 13:31:09,551 INFO L85 PathProgramCache]: Analyzing trace with hash -323633778, now seen corresponding path program 3 times [2023-01-10 13:31:09,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-10 13:31:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903769980] [2023-01-10 13:31:09,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-10 13:31:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-10 13:31:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-10 13:31:15,190 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-10 13:31:15,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-10 13:31:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903769980] [2023-01-10 13:31:15,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903769980] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-10 13:31:15,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117442323] [2023-01-10 13:31:15,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-10 13:31:15,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-10 13:31:15,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-10 13:31:15,192 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-01-10 13:31:15,193 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-01-10 13:31:15,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-10 13:31:15,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-10 13:31:15,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 127 conjunts are in the unsatisfiable core [2023-01-10 13:31:15,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-10 13:31:21,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:31:21,266 INFO L350 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 33 treesize of output 33 [2023-01-10 13:31:21,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-10 13:31:21,639 INFO L350 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 33 treesize of output 33 [2023-01-10 13:31:23,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-10 13:31:23,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 73 [2023-01-10 13:31:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-01-10 13:31:24,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-10 13:31:26,307 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~n~0 4))) (let ((.cse1 (+ (- 4) .cse4 c_~x~0.offset)) (.cse2 (+ .cse4 c_~x~0.offset))) (and (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (<= c_~x1~0 (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0#1.base| v_ArrVal_379) |c_thread4Thread1of1ForFork0_~#t6~0#1.base| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse0 .cse1) c_~s12~0 (select .cse0 .cse2))))) (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (let ((.cse3 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0#1.base| v_ArrVal_379) |c_thread4Thread1of1ForFork0_~#t6~0#1.base| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse3 .cse1) c_~s12~0 (select .cse3 .cse2))) (+ c_~x1~0 1)))))) is different from false [2023-01-10 13:31:26,399 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~n~0 4))) (let ((.cse1 (+ .cse4 c_~x~0.offset)) (.cse2 (+ (- 4) .cse4 c_~x~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0#1.base| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse0 .cse1) c_~s12~0 (select .cse0 .cse2))) (+ c_~x1~0 1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (<= c_~x1~0 (let ((.cse3 (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0#1.base| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse3 .cse1) c_~s12~0 (select .cse3 .cse2))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|)))))) is different from false [2023-01-10 13:31:28,471 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~n~0 4))) (let ((.cse1 (+ .cse4 c_~x~0.offset)) (.cse2 (+ (- 4) .cse4 c_~x~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse0 .cse1) c_~s12~0 (select .cse0 .cse2))) (+ c_~x1~0 1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (<= c_~x1~0 (let ((.cse3 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse3 .cse1) c_~s12~0 (select .cse3 .cse2))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|)))))))) is different from false [2023-01-10 13:31:30,930 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~n~0 4))) (let ((.cse1 (+ .cse4 c_~x~0.offset)) (.cse2 (+ (- 4) .cse4 c_~x~0.offset))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (<= (+ c_~s11~0 c_~s21~0) (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse0 .cse1) c_~s12~0 (select .cse0 .cse2))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (let ((.cse3 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse3 .cse1) c_~s12~0 (select .cse3 .cse2))) (+ c_~s11~0 c_~s21~0 1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|)))))))) is different from false [2023-01-10 13:31:41,391 WARN L222 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:31:51,744 WARN L222 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-10 13:31:53,896 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~i1~0 4))) (let ((.cse1 (+ (- 4) c_~x~0.offset .cse4)) (.cse2 (+ c_~x~0.offset .cse4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse0 .cse1) c_~s12~0 (select .cse0 .cse2))) (+ c_~s11~0 c_~s21~0 1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (<= (+ c_~s11~0 c_~s21~0) (let ((.cse3 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse3 .cse1) c_~s12~0 (select .cse3 .cse2))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|)))))))) is different from false [2023-01-10 13:31:56,210 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~i1~0 4))) (let ((.cse1 (+ (- 4) c_~x~0.offset .cse4)) (.cse2 (+ c_~x~0.offset .cse4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (<= (+ c_~s11~0 c_~t21~0 c_~s21~0) (let ((.cse0 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse0 .cse1) c_~s12~0 (select .cse0 .cse2))))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| Int)) (or (forall ((v_ArrVal_380 (Array Int Int)) (v_ArrVal_379 (Array Int Int))) (< (let ((.cse3 (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0#1.base_23| v_ArrVal_379) |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| v_ArrVal_380) c_~x~0.base))) (+ c_~s22~0 (select .cse3 .cse1) c_~s12~0 (select .cse3 .cse2))) (+ c_~s11~0 c_~t21~0 c_~s21~0 1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0#1.base_23| |c_#StackHeapBarrier|)))))))) is different from false Received shutdown request... [2023-01-10 13:33:57,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:57,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:57,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:57,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:57,537 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-10 13:33:58,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-10 13:33:58,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-01-10 13:33:58,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2023-01-10 13:33:58,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2023-01-10 13:33:58,739 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-10 13:33:58,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-10 13:33:58,811 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-01-10 13:33:58,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-10 13:33:58,811 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 256 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-01-10 13:33:58,815 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2023-01-10 13:33:58,815 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (3/11) [2023-01-10 13:33:58,816 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-10 13:33:58,816 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-10 13:33:58,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 01:33:58 BasicIcfg [2023-01-10 13:33:58,818 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-10 13:33:58,818 INFO L158 Benchmark]: Toolchain (without parser) took 862904.40ms. Allocated memory was 204.5MB in the beginning and 1.2GB in the end (delta: 950.0MB). Free memory was 145.1MB in the beginning and 754.4MB in the end (delta: -609.3MB). Peak memory consumption was 341.7MB. Max. memory is 8.0GB. [2023-01-10 13:33:58,818 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 204.5MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-10 13:33:58,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.46ms. Allocated memory is still 204.5MB. Free memory was 144.8MB in the beginning and 131.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-01-10 13:33:58,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.99ms. Allocated memory is still 204.5MB. Free memory was 131.9MB in the beginning and 128.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-01-10 13:33:58,819 INFO L158 Benchmark]: Boogie Preprocessor took 52.18ms. Allocated memory is still 204.5MB. Free memory was 128.8MB in the beginning and 126.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-10 13:33:58,819 INFO L158 Benchmark]: RCFGBuilder took 757.22ms. Allocated memory was 204.5MB in the beginning and 358.6MB in the end (delta: 154.1MB). Free memory was 126.2MB in the beginning and 268.6MB in the end (delta: -142.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2023-01-10 13:33:58,819 INFO L158 Benchmark]: TraceAbstraction took 861773.92ms. Allocated memory was 358.6MB in the beginning and 1.2GB in the end (delta: 795.9MB). Free memory was 268.1MB in the beginning and 754.4MB in the end (delta: -486.3MB). Peak memory consumption was 309.6MB. Max. memory is 8.0GB. [2023-01-10 13:33:58,820 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 204.5MB. Free memory is still 155.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.46ms. Allocated memory is still 204.5MB. Free memory was 144.8MB in the beginning and 131.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.99ms. Allocated memory is still 204.5MB. Free memory was 131.9MB in the beginning and 128.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.18ms. Allocated memory is still 204.5MB. Free memory was 128.8MB in the beginning and 126.4MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 757.22ms. Allocated memory was 204.5MB in the beginning and 358.6MB in the end (delta: 154.1MB). Free memory was 126.2MB in the beginning and 268.6MB in the end (delta: -142.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. * TraceAbstraction took 861773.92ms. Allocated memory was 358.6MB in the beginning and 1.2GB in the end (delta: 795.9MB). Free memory was 268.1MB in the beginning and 754.4MB in the end (delta: -486.3MB). Peak memory consumption was 309.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2114733816153551.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: Traversal Statistics Data States: 0, Transitions: 0, Traversal time: 2114733875094870.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 354239, independent: 328118, independent conditional: 328118, independent unconditional: 0, dependent: 26121, dependent conditional: 26121, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 329099, independent: 328118, independent conditional: 328118, independent unconditional: 0, dependent: 981, dependent conditional: 981, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 329099, independent: 328118, independent conditional: 328118, independent unconditional: 0, dependent: 981, dependent conditional: 981, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 332376, independent: 328118, independent conditional: 120, independent unconditional: 327998, dependent: 4258, dependent conditional: 3157, dependent unconditional: 1101, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 332376, independent: 328118, independent conditional: 120, independent unconditional: 327998, dependent: 4258, dependent conditional: 2530, dependent unconditional: 1728, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 332376, independent: 328118, independent conditional: 120, independent unconditional: 327998, dependent: 4258, dependent conditional: 2530, dependent unconditional: 1728, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1712, independent: 1611, independent conditional: 2, independent unconditional: 1609, dependent: 101, dependent conditional: 93, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1712, independent: 1603, independent conditional: 0, independent unconditional: 1603, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 109, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 101, dependent conditional: 93, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 109, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 101, dependent conditional: 93, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 369, independent: 42, independent conditional: 6, independent unconditional: 36, dependent: 328, dependent conditional: 304, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 332376, independent: 326507, independent conditional: 118, independent unconditional: 326389, dependent: 4157, dependent conditional: 2437, dependent unconditional: 1720, unknown: 1712, unknown conditional: 95, unknown unconditional: 1617] , Statistics on independence cache: Total cache size (in pairs): 1712, Positive cache size: 1611, Positive conditional cache size: 2, Positive unconditional cache size: 1609, Negative cache size: 101, Negative conditional cache size: 93, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 627, Maximal queried relation: 5, Independence queries for same thread: 25140 - StatisticsResult: Traversal Statistics Data States: 226, Transitions: 226, Traversal time: 127230421.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 0 - StatisticsResult: Traversal Statistics Data States: 730, Transitions: 943, Traversal time: 131299435.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 45 - StatisticsResult: Traversal Statistics Data States: 1191, Transitions: 1534, Traversal time: 308166185.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 90 - StatisticsResult: Traversal Statistics Data States: 1556, Transitions: 1917, Traversal time: 431323950.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 129 - StatisticsResult: Traversal Statistics Data States: 18611, Transitions: 23603, Traversal time: 3210130560.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 1904 - StatisticsResult: Traversal Statistics Data States: 24446, Transitions: 31499, Traversal time: 10026676574.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 2443 - StatisticsResult: Traversal Statistics Data States: 49354, Transitions: 61565, Traversal time: 419324651994.0ns - StatisticsResult: Traversal Statistics Data Sleep-blocked states: 5108 - TimeoutResultAtElement [Line: 166]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 256 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 13 procedures, 366 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 52879221.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 4963548.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 22732419.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 13 procedures, 366 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 7875830.0ns, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 161537.0ns, FeasibilityCheckTime: 0.0ns, RefinementTime: 0.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 5233569.0ns, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 13 procedures, 366 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 861479407857.0ns, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 670661108539.0ns, FeasibilityCheckTime: 190167458390.0ns, RefinementTime: 27647302.0ns, AutomataDifference: 0.0ns, DeadEndRemovalTime: 0.0ns, HoareAnnotationTime: 0.0ns, InitialAbstractionConstructionTime: 3173560.0ns, HoareTripleCheckerStatistics: 433 mSolverCounterUnknown, 20916 SdHoareTripleChecker+Valid, 273072597120.0ns IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20916 mSDsluCounter, 31831 SdHoareTripleChecker+Invalid, 269976360506.0ns Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30152 mSDsCounter, 347 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13104 IncrementalHoareTripleChecker+Invalid, 13884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 347 mSolverCounterUnsat, 1679 mSDtfsCounter, 13104 mSolverCounterSat, 184739898.0ns SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: No data available, 0.0ns BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ns DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 126536264.0ns SsaConstructionTime, 702038640.0ns SatisfiabilityAnalysisTime, 19714670401.0ns InterpolantComputationTime, 2070 NumberOfCodeBlocks, 2070 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2769 ConstructedInterpolants, 87 QuantifiedInterpolants, 22297 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1989 ConjunctsInSsa, 153 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 87/166 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown