/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:29:33,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:29:33,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:29:33,407 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:29:33,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:29:33,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:29:33,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:29:33,424 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:29:33,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:29:33,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:29:33,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:29:33,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:29:33,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:29:33,429 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:29:33,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:29:33,435 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:29:33,436 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:29:33,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:29:33,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:29:33,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:29:33,446 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:29:33,456 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:29:33,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:29:33,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:29:33,458 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:29:33,458 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:29:33,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:29:33,459 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:29:33,459 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:29:33,460 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:29:33,460 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:29:33,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:29:33,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:29:33,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:29:33,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:29:33,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:29:33,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:29:33,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:29:33,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:29:33,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:29:33,463 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:29:33,464 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-Before.epf [2022-01-19 04:29:33,480 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:29:33,480 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:29:33,481 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:29:33,481 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:29:33,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:29:33,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:29:33,481 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:29:33,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:29:33,481 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:29:33,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:29:33,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:29:33,483 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:29:33,483 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:29:33,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:29:33,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:29:33,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:29:33,484 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:29:33,485 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:29:33,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:29:33,485 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:29:33,486 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:29:33,486 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:29:33,486 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 [2022-01-19 04:29:33,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:29:33,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:29:33,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:29:33,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:29:33,680 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:29:33,681 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2022-01-19 04:29:33,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fb22238/f2cac81737874414b3b3bf67ab8092a5/FLAG71f0d5519 [2022-01-19 04:29:34,247 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:29:34,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2022-01-19 04:29:34,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fb22238/f2cac81737874414b3b3bf67ab8092a5/FLAG71f0d5519 [2022-01-19 04:29:34,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17fb22238/f2cac81737874414b3b3bf67ab8092a5 [2022-01-19 04:29:34,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:29:34,715 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:29:34,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:29:34,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:29:34,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:29:34,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:29:34" (1/1) ... [2022-01-19 04:29:34,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618f93fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:34, skipping insertion in model container [2022-01-19 04:29:34,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:29:34" (1/1) ... [2022-01-19 04:29:34,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:29:34,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:29:35,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2022-01-19 04:29:35,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:29:35,314 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:29:35,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2022-01-19 04:29:35,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:29:35,425 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:29:35,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35 WrapperNode [2022-01-19 04:29:35,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:29:35,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:29:35,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:29:35,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:29:35,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,514 INFO L137 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2022-01-19 04:29:35,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:29:35,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:29:35,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:29:35,516 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:29:35,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,540 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:29:35,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:29:35,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:29:35,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:29:35,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (1/1) ... [2022-01-19 04:29:35,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:29:35,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:35,582 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) [2022-01-19 04:29:35,585 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 [2022-01-19 04:29:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 04:29:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-01-19 04:29:35,630 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-01-19 04:29:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:29:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:29:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:29:35,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:29:35,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:29:35,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:29:35,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:29:35,634 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 04:29:35,713 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:29:35,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:29:35,863 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:29:35,908 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:29:35,908 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 04:29:35,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:29:35 BoogieIcfgContainer [2022-01-19 04:29:35,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:29:35,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:29:35,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:29:35,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:29:35,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:29:34" (1/3) ... [2022-01-19 04:29:35,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c13d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:29:35, skipping insertion in model container [2022-01-19 04:29:35,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:35" (2/3) ... [2022-01-19 04:29:35,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c13d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:29:35, skipping insertion in model container [2022-01-19 04:29:35,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:29:35" (3/3) ... [2022-01-19 04:29:35,916 INFO L111 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2022-01-19 04:29:35,919 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:29:35,919 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 04:29:35,919 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:29:35,942 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,942 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,942 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,942 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,942 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,943 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,944 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,945 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,946 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,947 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,948 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,949 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,950 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,951 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,952 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,953 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,954 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,955 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,956 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,957 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,958 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,959 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,960 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,961 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,961 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,961 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,961 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,961 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,961 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,963 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,964 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,965 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,972 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,973 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,975 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,976 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#ret~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,977 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~v#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~u#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,978 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~r#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_#in~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~e#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,979 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:35,980 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:29:36,041 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:29:36,050 INFO L339 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=false, mAutomataTypeConcurrency=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 04:29:36,050 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-19 04:29:36,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 97 transitions, 199 flow [2022-01-19 04:29:36,126 INFO L129 PetriNetUnfolder]: 10/108 cut-off events. [2022-01-19 04:29:36,127 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:29:36,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 108 events. 10/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 130 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 77. Up to 4 conditions per place. [2022-01-19 04:29:36,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 97 transitions, 199 flow [2022-01-19 04:29:36,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 97 transitions, 199 flow [2022-01-19 04:29:36,164 INFO L129 PetriNetUnfolder]: 8/97 cut-off events. [2022-01-19 04:29:36,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:29:36,164 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:36,165 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:36,165 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:36,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:36,171 INFO L85 PathProgramCache]: Analyzing trace with hash 793417479, now seen corresponding path program 1 times [2022-01-19 04:29:36,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:36,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76425677] [2022-01-19 04:29:36,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:36,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:36,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:36,381 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:36,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76425677] [2022-01-19 04:29:36,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76425677] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:29:36,383 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:29:36,383 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 04:29:36,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485563366] [2022-01-19 04:29:36,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:29:36,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 04:29:36,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 04:29:36,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 04:29:36,426 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 97 [2022-01-19 04:29:36,429 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 97 transitions, 199 flow. Second operand has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 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) [2022-01-19 04:29:36,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:36,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 97 [2022-01-19 04:29:36,430 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:36,481 INFO L129 PetriNetUnfolder]: 3/81 cut-off events. [2022-01-19 04:29:36,481 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 04:29:36,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 3/81 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 35 event pairs, 0 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 59. Up to 4 conditions per place. [2022-01-19 04:29:36,482 INFO L132 encePairwiseOnDemand]: 89/97 looper letters, 3 selfloop transitions, 0 changer transitions 1/77 dead transitions. [2022-01-19 04:29:36,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 165 flow [2022-01-19 04:29:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 04:29:36,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 04:29:36,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 181 transitions. [2022-01-19 04:29:36,501 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9329896907216495 [2022-01-19 04:29:36,501 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 181 transitions. [2022-01-19 04:29:36,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 181 transitions. [2022-01-19 04:29:36,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:36,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 181 transitions. [2022-01-19 04:29:36,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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) [2022-01-19 04:29:36,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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) [2022-01-19 04:29:36,516 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 97.0) internal successors, (291), 3 states have internal predecessors, (291), 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) [2022-01-19 04:29:36,518 INFO L186 Difference]: Start difference. First operand has 91 places, 97 transitions, 199 flow. Second operand 2 states and 181 transitions. [2022-01-19 04:29:36,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 165 flow [2022-01-19 04:29:36,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 77 transitions, 165 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:29:36,523 INFO L242 Difference]: Finished difference. Result has 78 places, 76 transitions, 157 flow [2022-01-19 04:29:36,525 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=157, PETRI_PLACES=78, PETRI_TRANSITIONS=76} [2022-01-19 04:29:36,528 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, -13 predicate places. [2022-01-19 04:29:36,528 INFO L470 AbstractCegarLoop]: Abstraction has has 78 places, 76 transitions, 157 flow [2022-01-19 04:29:36,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 86.5) internal successors, (173), 2 states have internal predecessors, (173), 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) [2022-01-19 04:29:36,529 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:36,529 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:36,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:29:36,529 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2079283686, now seen corresponding path program 1 times [2022-01-19 04:29:36,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:36,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517204244] [2022-01-19 04:29:36,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:36,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:36,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:36,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:36,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517204244] [2022-01-19 04:29:36,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517204244] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:29:36,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:29:36,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-19 04:29:36,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019154472] [2022-01-19 04:29:36,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:29:36,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-19 04:29:36,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-19 04:29:36,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-01-19 04:29:36,953 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 97 [2022-01-19 04:29:36,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 76 transitions, 157 flow. Second operand has 13 states, 13 states have (on average 52.38461538461539) internal successors, (681), 13 states have internal predecessors, (681), 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) [2022-01-19 04:29:36,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:36,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 97 [2022-01-19 04:29:36,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:37,316 INFO L129 PetriNetUnfolder]: 70/304 cut-off events. [2022-01-19 04:29:37,316 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:29:37,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 304 events. 70/304 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 864 event pairs, 3 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 511. Up to 115 conditions per place. [2022-01-19 04:29:37,318 INFO L132 encePairwiseOnDemand]: 79/97 looper letters, 53 selfloop transitions, 35 changer transitions 0/129 dead transitions. [2022-01-19 04:29:37,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 129 transitions, 439 flow [2022-01-19 04:29:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 04:29:37,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 04:29:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1041 transitions. [2022-01-19 04:29:37,322 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5648399348887683 [2022-01-19 04:29:37,322 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1041 transitions. [2022-01-19 04:29:37,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1041 transitions. [2022-01-19 04:29:37,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:37,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1041 transitions. [2022-01-19 04:29:37,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 54.78947368421053) internal successors, (1041), 19 states have internal predecessors, (1041), 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) [2022-01-19 04:29:37,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 97.0) internal successors, (1940), 20 states have internal predecessors, (1940), 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) [2022-01-19 04:29:37,347 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 97.0) internal successors, (1940), 20 states have internal predecessors, (1940), 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) [2022-01-19 04:29:37,347 INFO L186 Difference]: Start difference. First operand has 78 places, 76 transitions, 157 flow. Second operand 19 states and 1041 transitions. [2022-01-19 04:29:37,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 129 transitions, 439 flow [2022-01-19 04:29:37,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 439 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:29:37,351 INFO L242 Difference]: Finished difference. Result has 103 places, 111 transitions, 377 flow [2022-01-19 04:29:37,351 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=377, PETRI_PLACES=103, PETRI_TRANSITIONS=111} [2022-01-19 04:29:37,352 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 12 predicate places. [2022-01-19 04:29:37,352 INFO L470 AbstractCegarLoop]: Abstraction has has 103 places, 111 transitions, 377 flow [2022-01-19 04:29:37,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 52.38461538461539) internal successors, (681), 13 states have internal predecessors, (681), 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) [2022-01-19 04:29:37,353 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:37,354 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:37,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:29:37,354 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:37,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1483188372, now seen corresponding path program 1 times [2022-01-19 04:29:37,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:37,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480883783] [2022-01-19 04:29:37,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:37,355 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:37,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:37,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480883783] [2022-01-19 04:29:37,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480883783] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:37,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625008531] [2022-01-19 04:29:37,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:37,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:37,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:37,706 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:29:37,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 04:29:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:37,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-19 04:29:37,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:38,007 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:29:38,145 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:38,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:29:38,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:29:38,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-01-19 04:29:38,640 INFO L353 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2022-01-19 04:29:38,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 25 [2022-01-19 04:29:38,772 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 04:29:38,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-01-19 04:29:38,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:38,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:38,842 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_98 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| v_ArrVal_98) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| (store (select .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0)))) is different from false [2022-01-19 04:29:38,856 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_98 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| v_ArrVal_98) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| (store (select .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0)))) is different from false [2022-01-19 04:29:38,904 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| (store (select .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse1)) (or (forall ((v_ArrVal_98 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| v_ArrVal_98) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse1))) is different from false [2022-01-19 04:29:38,935 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_96 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| Int)) (not (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_96))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5| (store (select .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_5|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2022-01-19 04:29:39,015 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:39,015 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:29:39,023 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:39,023 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:29:39,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-19 04:29:39,076 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:39,076 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 795 treesize of output 775 [2022-01-19 04:29:39,102 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:39,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 710 treesize of output 673 [2022-01-19 04:29:39,430 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 18 [2022-01-19 04:29:39,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-19 04:29:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 04:29:39,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625008531] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:39,731 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:39,732 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 35 [2022-01-19 04:29:39,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049581187] [2022-01-19 04:29:39,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:39,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 04:29:39,732 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:39,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 04:29:39,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=805, Unknown=4, NotChecked=244, Total=1190 [2022-01-19 04:29:39,735 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2022-01-19 04:29:39,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 111 transitions, 377 flow. Second operand has 35 states, 35 states have (on average 42.74285714285714) internal successors, (1496), 35 states have internal predecessors, (1496), 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) [2022-01-19 04:29:39,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:39,737 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2022-01-19 04:29:39,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:40,227 INFO L129 PetriNetUnfolder]: 84/389 cut-off events. [2022-01-19 04:29:40,228 INFO L130 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-01-19 04:29:40,230 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 389 events. 84/389 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1519 event pairs, 3 based on Foata normal form. 2/384 useless extension candidates. Maximal degree in co-relation 904. Up to 163 conditions per place. [2022-01-19 04:29:40,232 INFO L132 encePairwiseOnDemand]: 78/97 looper letters, 80 selfloop transitions, 37 changer transitions 0/151 dead transitions. [2022-01-19 04:29:40,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 151 transitions, 762 flow [2022-01-19 04:29:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:29:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:29:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 728 transitions. [2022-01-19 04:29:40,234 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4690721649484536 [2022-01-19 04:29:40,235 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 728 transitions. [2022-01-19 04:29:40,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 728 transitions. [2022-01-19 04:29:40,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:40,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 728 transitions. [2022-01-19 04:29:40,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 45.5) internal successors, (728), 16 states have internal predecessors, (728), 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) [2022-01-19 04:29:40,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 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) [2022-01-19 04:29:40,239 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 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) [2022-01-19 04:29:40,239 INFO L186 Difference]: Start difference. First operand has 103 places, 111 transitions, 377 flow. Second operand 16 states and 728 transitions. [2022-01-19 04:29:40,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 151 transitions, 762 flow [2022-01-19 04:29:40,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 151 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 04:29:40,250 INFO L242 Difference]: Finished difference. Result has 126 places, 130 transitions, 627 flow [2022-01-19 04:29:40,251 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=627, PETRI_PLACES=126, PETRI_TRANSITIONS=130} [2022-01-19 04:29:40,252 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 35 predicate places. [2022-01-19 04:29:40,253 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 130 transitions, 627 flow [2022-01-19 04:29:40,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 42.74285714285714) internal successors, (1496), 35 states have internal predecessors, (1496), 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) [2022-01-19 04:29:40,253 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:40,254 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:40,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:40,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:40,470 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:40,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:40,471 INFO L85 PathProgramCache]: Analyzing trace with hash -852372972, now seen corresponding path program 2 times [2022-01-19 04:29:40,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:40,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176062953] [2022-01-19 04:29:40,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:40,471 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:40,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:40,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176062953] [2022-01-19 04:29:40,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176062953] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:40,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695081022] [2022-01-19 04:29:40,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:29:40,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:40,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:40,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:29:40,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 04:29:40,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:29:40,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:29:40,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-19 04:29:40,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:40,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:29:40,896 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:40,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:29:40,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:29:41,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-01-19 04:29:41,226 INFO L353 Elim1Store]: treesize reduction 68, result has 41.9 percent of original size [2022-01-19 04:29:41,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 91 treesize of output 117 [2022-01-19 04:29:41,232 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2022-01-19 04:29:41,273 INFO L353 Elim1Store]: treesize reduction 62, result has 42.1 percent of original size [2022-01-19 04:29:41,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 92 treesize of output 128 [2022-01-19 04:29:41,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 17 treesize of output 15 [2022-01-19 04:29:41,450 INFO L353 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-01-19 04:29:41,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2022-01-19 04:29:41,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:41,487 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-19 04:29:41,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2022-01-19 04:29:41,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:29:41,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-01-19 04:29:41,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:41,720 INFO L353 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2022-01-19 04:29:41,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 75 [2022-01-19 04:29:41,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:29:41,765 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 18 treesize of output 15 [2022-01-19 04:29:41,780 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:29:41,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:29:41,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:41,832 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-19 04:29:41,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-19 04:29:41,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:29:41,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2022-01-19 04:29:41,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:29:42,027 INFO L353 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-01-19 04:29:42,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 34 [2022-01-19 04:29:42,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:42,042 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:42,045 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 45 treesize of output 45 [2022-01-19 04:29:42,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-01-19 04:29:42,066 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:42,077 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 04:29:42,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 38 [2022-01-19 04:29:42,079 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:29:42,271 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 04:29:42,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-01-19 04:29:42,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:42,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:42,372 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_164) |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2022-01-19 04:29:42,424 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:42,424 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:29:42,440 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:42,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:29:42,472 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:42,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 574 treesize of output 559 [2022-01-19 04:29:42,482 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:42,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 550 treesize of output 535 [2022-01-19 04:29:42,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 526 treesize of output 510 [2022-01-19 04:29:42,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-19 04:29:42,660 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:42,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 586 treesize of output 568 [2022-01-19 04:29:42,670 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:42,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 553 treesize of output 538 [2022-01-19 04:29:42,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 529 treesize of output 513 [2022-01-19 04:29:42,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 30 [2022-01-19 04:29:43,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-19 04:29:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 04:29:43,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695081022] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:43,358 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:43,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 35 [2022-01-19 04:29:43,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108649419] [2022-01-19 04:29:43,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:43,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-19 04:29:43,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:43,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-19 04:29:43,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=966, Unknown=16, NotChecked=64, Total=1190 [2022-01-19 04:29:43,360 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2022-01-19 04:29:43,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 130 transitions, 627 flow. Second operand has 35 states, 35 states have (on average 42.51428571428571) internal successors, (1488), 35 states have internal predecessors, (1488), 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) [2022-01-19 04:29:43,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:43,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2022-01-19 04:29:43,362 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:43,670 INFO L129 PetriNetUnfolder]: 90/410 cut-off events. [2022-01-19 04:29:43,670 INFO L130 PetriNetUnfolder]: For 464/464 co-relation queries the response was YES. [2022-01-19 04:29:43,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 410 events. 90/410 cut-off events. For 464/464 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1619 event pairs, 3 based on Foata normal form. 1/403 useless extension candidates. Maximal degree in co-relation 1133. Up to 178 conditions per place. [2022-01-19 04:29:43,673 INFO L132 encePairwiseOnDemand]: 79/97 looper letters, 80 selfloop transitions, 35 changer transitions 0/155 dead transitions. [2022-01-19 04:29:43,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 155 transitions, 975 flow [2022-01-19 04:29:43,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 04:29:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 04:29:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 679 transitions. [2022-01-19 04:29:43,675 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-01-19 04:29:43,675 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 679 transitions. [2022-01-19 04:29:43,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 679 transitions. [2022-01-19 04:29:43,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:43,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 679 transitions. [2022-01-19 04:29:43,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 45.266666666666666) internal successors, (679), 15 states have internal predecessors, (679), 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) [2022-01-19 04:29:43,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 97.0) internal successors, (1552), 16 states have internal predecessors, (1552), 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) [2022-01-19 04:29:43,680 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 97.0) internal successors, (1552), 16 states have internal predecessors, (1552), 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) [2022-01-19 04:29:43,680 INFO L186 Difference]: Start difference. First operand has 126 places, 130 transitions, 627 flow. Second operand 15 states and 679 transitions. [2022-01-19 04:29:43,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 155 transitions, 975 flow [2022-01-19 04:29:43,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 155 transitions, 963 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-01-19 04:29:43,686 INFO L242 Difference]: Finished difference. Result has 143 places, 141 transitions, 820 flow [2022-01-19 04:29:43,686 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=820, PETRI_PLACES=143, PETRI_TRANSITIONS=141} [2022-01-19 04:29:43,687 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 52 predicate places. [2022-01-19 04:29:43,687 INFO L470 AbstractCegarLoop]: Abstraction has has 143 places, 141 transitions, 820 flow [2022-01-19 04:29:43,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 42.51428571428571) internal successors, (1488), 35 states have internal predecessors, (1488), 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) [2022-01-19 04:29:43,688 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:43,688 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:43,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 04:29:43,903 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-19 04:29:43,904 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1166817440, now seen corresponding path program 3 times [2022-01-19 04:29:43,904 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:43,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634810659] [2022-01-19 04:29:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:43,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:44,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:44,022 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:44,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634810659] [2022-01-19 04:29:44,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634810659] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:44,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733323368] [2022-01-19 04:29:44,022 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:29:44,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:44,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:44,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:29:44,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 04:29:44,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:29:44,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:29:44,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 04:29:44,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:44,255 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:29:44,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 04:29:44,489 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:29:44,511 INFO L353 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-01-19 04:29:44,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2022-01-19 04:29:44,534 INFO L353 Elim1Store]: treesize reduction 30, result has 43.4 percent of original size [2022-01-19 04:29:44,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 68 [2022-01-19 04:29:44,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:44,572 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 15 [2022-01-19 04:29:44,595 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:44,618 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:29:44,639 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:29:44,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:44,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 04:29:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:44,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:44,898 INFO L353 Elim1Store]: treesize reduction 26, result has 65.3 percent of original size [2022-01-19 04:29:44,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 78 treesize of output 97 [2022-01-19 04:29:44,904 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:44,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-01-19 04:29:44,932 INFO L353 Elim1Store]: treesize reduction 23, result has 66.7 percent of original size [2022-01-19 04:29:44,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 66 treesize of output 98 [2022-01-19 04:29:44,973 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:29:44,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-19 04:29:44,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-19 04:29:44,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:44,992 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 25 [2022-01-19 04:29:45,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-01-19 04:29:45,044 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:45,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 17 [2022-01-19 04:29:45,053 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:45,053 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:29:45,055 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:29:45,056 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2022-01-19 04:29:45,104 INFO L353 Elim1Store]: treesize reduction 11, result has 60.7 percent of original size [2022-01-19 04:29:45,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 35 [2022-01-19 04:29:45,191 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:45,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:29:45,196 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:45,197 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:29:45,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-19 04:29:45,240 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-01-19 04:29:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:45,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733323368] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:45,370 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:45,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 25 [2022-01-19 04:29:45,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778169621] [2022-01-19 04:29:45,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:45,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-19 04:29:45,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:45,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-19 04:29:45,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2022-01-19 04:29:45,372 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 97 [2022-01-19 04:29:45,373 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 141 transitions, 820 flow. Second operand has 25 states, 25 states have (on average 50.76) internal successors, (1269), 25 states have internal predecessors, (1269), 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) [2022-01-19 04:29:45,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:45,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 97 [2022-01-19 04:29:45,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:45,691 INFO L129 PetriNetUnfolder]: 96/460 cut-off events. [2022-01-19 04:29:45,691 INFO L130 PetriNetUnfolder]: For 746/746 co-relation queries the response was YES. [2022-01-19 04:29:45,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1407 conditions, 460 events. 96/460 cut-off events. For 746/746 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1970 event pairs, 1 based on Foata normal form. 1/455 useless extension candidates. Maximal degree in co-relation 1380. Up to 194 conditions per place. [2022-01-19 04:29:45,694 INFO L132 encePairwiseOnDemand]: 79/97 looper letters, 85 selfloop transitions, 50 changer transitions 0/181 dead transitions. [2022-01-19 04:29:45,694 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 181 transitions, 1280 flow [2022-01-19 04:29:45,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 04:29:45,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 04:29:45,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 957 transitions. [2022-01-19 04:29:45,696 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5481099656357389 [2022-01-19 04:29:45,697 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 957 transitions. [2022-01-19 04:29:45,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 957 transitions. [2022-01-19 04:29:45,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:45,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 957 transitions. [2022-01-19 04:29:45,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 53.166666666666664) internal successors, (957), 18 states have internal predecessors, (957), 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) [2022-01-19 04:29:45,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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) [2022-01-19 04:29:45,701 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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) [2022-01-19 04:29:45,701 INFO L186 Difference]: Start difference. First operand has 143 places, 141 transitions, 820 flow. Second operand 18 states and 957 transitions. [2022-01-19 04:29:45,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 181 transitions, 1280 flow [2022-01-19 04:29:45,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 181 transitions, 1257 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-01-19 04:29:45,709 INFO L242 Difference]: Finished difference. Result has 159 places, 160 transitions, 1098 flow [2022-01-19 04:29:45,709 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1098, PETRI_PLACES=159, PETRI_TRANSITIONS=160} [2022-01-19 04:29:45,710 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 68 predicate places. [2022-01-19 04:29:45,711 INFO L470 AbstractCegarLoop]: Abstraction has has 159 places, 160 transitions, 1098 flow [2022-01-19 04:29:45,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 50.76) internal successors, (1269), 25 states have internal predecessors, (1269), 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) [2022-01-19 04:29:45,711 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:45,711 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:45,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:45,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:45,928 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:45,928 INFO L85 PathProgramCache]: Analyzing trace with hash -400837664, now seen corresponding path program 4 times [2022-01-19 04:29:45,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:45,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316676753] [2022-01-19 04:29:45,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:45,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:46,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316676753] [2022-01-19 04:29:46,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316676753] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:46,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275723151] [2022-01-19 04:29:46,278 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 04:29:46,278 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:46,281 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) [2022-01-19 04:29:46,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 04:29:46,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 04:29:46,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:29:46,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-19 04:29:46,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:46,438 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:46,438 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:29:46,986 INFO L353 Elim1Store]: treesize reduction 58, result has 31.8 percent of original size [2022-01-19 04:29:46,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 38 [2022-01-19 04:29:47,125 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-19 04:29:47,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 31 [2022-01-19 04:29:47,206 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-19 04:29:47,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:47,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:29:47,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275723151] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:29:47,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:29:47,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [18] total 29 [2022-01-19 04:29:47,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037417063] [2022-01-19 04:29:47,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:29:47,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 04:29:47,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:47,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 04:29:47,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2022-01-19 04:29:47,211 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2022-01-19 04:29:47,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 160 transitions, 1098 flow. Second operand has 14 states, 14 states have (on average 43.714285714285715) internal successors, (612), 14 states have internal predecessors, (612), 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) [2022-01-19 04:29:47,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:47,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2022-01-19 04:29:47,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:47,513 INFO L129 PetriNetUnfolder]: 119/608 cut-off events. [2022-01-19 04:29:47,514 INFO L130 PetriNetUnfolder]: For 1194/1194 co-relation queries the response was YES. [2022-01-19 04:29:47,516 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1976 conditions, 608 events. 119/608 cut-off events. For 1194/1194 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2999 event pairs, 3 based on Foata normal form. 1/603 useless extension candidates. Maximal degree in co-relation 1944. Up to 227 conditions per place. [2022-01-19 04:29:47,519 INFO L132 encePairwiseOnDemand]: 78/97 looper letters, 122 selfloop transitions, 72 changer transitions 0/237 dead transitions. [2022-01-19 04:29:47,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 237 transitions, 1926 flow [2022-01-19 04:29:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 04:29:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 04:29:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 859 transitions. [2022-01-19 04:29:47,522 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4919816723940435 [2022-01-19 04:29:47,522 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 859 transitions. [2022-01-19 04:29:47,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 859 transitions. [2022-01-19 04:29:47,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:47,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 859 transitions. [2022-01-19 04:29:47,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 47.72222222222222) internal successors, (859), 18 states have internal predecessors, (859), 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) [2022-01-19 04:29:47,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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) [2022-01-19 04:29:47,528 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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) [2022-01-19 04:29:47,528 INFO L186 Difference]: Start difference. First operand has 159 places, 160 transitions, 1098 flow. Second operand 18 states and 859 transitions. [2022-01-19 04:29:47,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 237 transitions, 1926 flow [2022-01-19 04:29:47,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 237 transitions, 1896 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-01-19 04:29:47,543 INFO L242 Difference]: Finished difference. Result has 181 places, 192 transitions, 1655 flow [2022-01-19 04:29:47,543 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1655, PETRI_PLACES=181, PETRI_TRANSITIONS=192} [2022-01-19 04:29:47,546 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 90 predicate places. [2022-01-19 04:29:47,546 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 192 transitions, 1655 flow [2022-01-19 04:29:47,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 43.714285714285715) internal successors, (612), 14 states have internal predecessors, (612), 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) [2022-01-19 04:29:47,546 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:47,546 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:47,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:47,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:47,759 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:47,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1784185132, now seen corresponding path program 5 times [2022-01-19 04:29:47,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:47,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15300954] [2022-01-19 04:29:47,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:47,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:48,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:48,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15300954] [2022-01-19 04:29:48,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15300954] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:48,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405867357] [2022-01-19 04:29:48,063 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 04:29:48,063 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:48,064 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) [2022-01-19 04:29:48,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 04:29:48,157 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:29:48,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:29:48,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 71 conjunts are in the unsatisfiable core [2022-01-19 04:29:48,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:48,245 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:29:48,245 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:29:48,335 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-19 04:29:48,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:29:48,365 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-19 04:29:48,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:29:48,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:29:48,763 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-19 04:29:48,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 24 [2022-01-19 04:29:48,769 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 04:29:48,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-01-19 04:29:48,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-01-19 04:29:48,934 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 04:29:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:48,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:48,987 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_353 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_353) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2022-01-19 04:29:49,273 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:49,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:29:49,277 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:49,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:29:49,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-19 04:29:49,316 INFO L353 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2022-01-19 04:29:49,316 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 42 [2022-01-19 04:29:49,320 INFO L353 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-01-19 04:29:49,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 154 treesize of output 130 [2022-01-19 04:29:49,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 110 [2022-01-19 04:29:49,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 102 [2022-01-19 04:29:49,711 INFO L353 Elim1Store]: treesize reduction 14, result has 44.0 percent of original size [2022-01-19 04:29:49,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 37 [2022-01-19 04:29:49,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 04:29:49,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405867357] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:49,745 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:49,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 41 [2022-01-19 04:29:49,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752442349] [2022-01-19 04:29:49,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:49,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-19 04:29:49,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:49,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-19 04:29:49,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1314, Unknown=22, NotChecked=76, Total=1640 [2022-01-19 04:29:49,747 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2022-01-19 04:29:49,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 192 transitions, 1655 flow. Second operand has 41 states, 41 states have (on average 42.51219512195122) internal successors, (1743), 41 states have internal predecessors, (1743), 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) [2022-01-19 04:29:49,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:49,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2022-01-19 04:29:49,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:49,998 INFO L129 PetriNetUnfolder]: 121/698 cut-off events. [2022-01-19 04:29:49,998 INFO L130 PetriNetUnfolder]: For 2036/2036 co-relation queries the response was YES. [2022-01-19 04:29:50,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2496 conditions, 698 events. 121/698 cut-off events. For 2036/2036 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3918 event pairs, 2 based on Foata normal form. 1/693 useless extension candidates. Maximal degree in co-relation 2452. Up to 232 conditions per place. [2022-01-19 04:29:50,002 INFO L132 encePairwiseOnDemand]: 78/97 looper letters, 142 selfloop transitions, 55 changer transitions 0/239 dead transitions. [2022-01-19 04:29:50,002 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 239 transitions, 2295 flow [2022-01-19 04:29:50,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 04:29:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 04:29:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 826 transitions. [2022-01-19 04:29:50,004 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47308132875143183 [2022-01-19 04:29:50,004 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 826 transitions. [2022-01-19 04:29:50,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 826 transitions. [2022-01-19 04:29:50,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:50,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 826 transitions. [2022-01-19 04:29:50,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 45.888888888888886) internal successors, (826), 18 states have internal predecessors, (826), 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) [2022-01-19 04:29:50,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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) [2022-01-19 04:29:50,008 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 97.0) internal successors, (1843), 19 states have internal predecessors, (1843), 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) [2022-01-19 04:29:50,008 INFO L186 Difference]: Start difference. First operand has 181 places, 192 transitions, 1655 flow. Second operand 18 states and 826 transitions. [2022-01-19 04:29:50,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 239 transitions, 2295 flow [2022-01-19 04:29:50,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 239 transitions, 2281 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-01-19 04:29:50,021 INFO L242 Difference]: Finished difference. Result has 200 places, 201 transitions, 1934 flow [2022-01-19 04:29:50,022 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1934, PETRI_PLACES=200, PETRI_TRANSITIONS=201} [2022-01-19 04:29:50,022 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 109 predicate places. [2022-01-19 04:29:50,022 INFO L470 AbstractCegarLoop]: Abstraction has has 200 places, 201 transitions, 1934 flow [2022-01-19 04:29:50,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 42.51219512195122) internal successors, (1743), 41 states have internal predecessors, (1743), 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) [2022-01-19 04:29:50,023 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:50,023 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:50,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:50,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:50,239 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:50,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1627466957, now seen corresponding path program 1 times [2022-01-19 04:29:50,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:50,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724439899] [2022-01-19 04:29:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:50,239 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-19 04:29:50,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:50,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724439899] [2022-01-19 04:29:50,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724439899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:29:50,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:29:50,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:29:50,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118191208] [2022-01-19 04:29:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:29:50,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:29:50,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:29:50,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:29:50,291 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 97 [2022-01-19 04:29:50,292 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 201 transitions, 1934 flow. Second operand has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 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) [2022-01-19 04:29:50,292 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:50,292 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 97 [2022-01-19 04:29:50,292 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:50,401 INFO L129 PetriNetUnfolder]: 70/568 cut-off events. [2022-01-19 04:29:50,401 INFO L130 PetriNetUnfolder]: For 2112/2112 co-relation queries the response was YES. [2022-01-19 04:29:50,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2028 conditions, 568 events. 70/568 cut-off events. For 2112/2112 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2673 event pairs, 2 based on Foata normal form. 4/570 useless extension candidates. Maximal degree in co-relation 1980. Up to 186 conditions per place. [2022-01-19 04:29:50,404 INFO L132 encePairwiseOnDemand]: 88/97 looper letters, 78 selfloop transitions, 46 changer transitions 0/199 dead transitions. [2022-01-19 04:29:50,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 199 transitions, 2095 flow [2022-01-19 04:29:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 04:29:50,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 04:29:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 519 transitions. [2022-01-19 04:29:50,405 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6688144329896907 [2022-01-19 04:29:50,406 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 519 transitions. [2022-01-19 04:29:50,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 519 transitions. [2022-01-19 04:29:50,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:50,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 519 transitions. [2022-01-19 04:29:50,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 64.875) internal successors, (519), 8 states have internal predecessors, (519), 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) [2022-01-19 04:29:50,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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) [2022-01-19 04:29:50,408 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 97.0) internal successors, (873), 9 states have internal predecessors, (873), 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) [2022-01-19 04:29:50,409 INFO L186 Difference]: Start difference. First operand has 200 places, 201 transitions, 1934 flow. Second operand 8 states and 519 transitions. [2022-01-19 04:29:50,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 199 transitions, 2095 flow [2022-01-19 04:29:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 199 transitions, 2054 flow, removed 2 selfloop flow, removed 13 redundant places. [2022-01-19 04:29:50,423 INFO L242 Difference]: Finished difference. Result has 196 places, 191 transitions, 1963 flow [2022-01-19 04:29:50,423 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1614, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1963, PETRI_PLACES=196, PETRI_TRANSITIONS=191} [2022-01-19 04:29:50,424 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 105 predicate places. [2022-01-19 04:29:50,424 INFO L470 AbstractCegarLoop]: Abstraction has has 196 places, 191 transitions, 1963 flow [2022-01-19 04:29:50,425 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.83333333333333) internal successors, (389), 6 states have internal predecessors, (389), 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) [2022-01-19 04:29:50,425 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:50,425 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:50,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:29:50,425 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:50,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash 259230847, now seen corresponding path program 2 times [2022-01-19 04:29:50,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:50,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909425594] [2022-01-19 04:29:50,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:50,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:50,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:50,701 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:50,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:50,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909425594] [2022-01-19 04:29:50,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909425594] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:50,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421270137] [2022-01-19 04:29:50,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:29:50,702 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:50,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:50,703 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) [2022-01-19 04:29:50,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 04:29:50,801 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:29:50,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:29:50,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-19 04:29:50,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:50,853 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:50,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:29:51,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-01-19 04:29:51,092 INFO L353 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-01-19 04:29:51,092 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 51 [2022-01-19 04:29:51,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:51,097 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:51,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:29:51,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:29:51,129 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:51,146 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 04:29:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:51,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 04:29:51,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421270137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:29:51,169 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 04:29:51,169 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19] total 28 [2022-01-19 04:29:51,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708632858] [2022-01-19 04:29:51,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:29:51,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 04:29:51,170 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 04:29:51,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2022-01-19 04:29:51,171 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 97 [2022-01-19 04:29:51,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 191 transitions, 1963 flow. Second operand has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 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) [2022-01-19 04:29:51,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:51,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 97 [2022-01-19 04:29:51,172 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:51,468 INFO L129 PetriNetUnfolder]: 73/589 cut-off events. [2022-01-19 04:29:51,468 INFO L130 PetriNetUnfolder]: For 2619/2619 co-relation queries the response was YES. [2022-01-19 04:29:51,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2318 conditions, 589 events. 73/589 cut-off events. For 2619/2619 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2800 event pairs, 11 based on Foata normal form. 3/592 useless extension candidates. Maximal degree in co-relation 2264. Up to 133 conditions per place. [2022-01-19 04:29:51,472 INFO L132 encePairwiseOnDemand]: 83/97 looper letters, 89 selfloop transitions, 64 changer transitions 0/219 dead transitions. [2022-01-19 04:29:51,472 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 219 transitions, 2427 flow [2022-01-19 04:29:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 04:29:51,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 04:29:51,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1044 transitions. [2022-01-19 04:29:51,474 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5381443298969072 [2022-01-19 04:29:51,474 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1044 transitions. [2022-01-19 04:29:51,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1044 transitions. [2022-01-19 04:29:51,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:51,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1044 transitions. [2022-01-19 04:29:51,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 52.2) internal successors, (1044), 20 states have internal predecessors, (1044), 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) [2022-01-19 04:29:51,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 97.0) internal successors, (2037), 21 states have internal predecessors, (2037), 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) [2022-01-19 04:29:51,479 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 97.0) internal successors, (2037), 21 states have internal predecessors, (2037), 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) [2022-01-19 04:29:51,479 INFO L186 Difference]: Start difference. First operand has 196 places, 191 transitions, 1963 flow. Second operand 20 states and 1044 transitions. [2022-01-19 04:29:51,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 219 transitions, 2427 flow [2022-01-19 04:29:51,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 219 transitions, 2397 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 04:29:51,497 INFO L242 Difference]: Finished difference. Result has 219 places, 203 transitions, 2221 flow [2022-01-19 04:29:51,497 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1919, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2221, PETRI_PLACES=219, PETRI_TRANSITIONS=203} [2022-01-19 04:29:51,498 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 128 predicate places. [2022-01-19 04:29:51,498 INFO L470 AbstractCegarLoop]: Abstraction has has 219 places, 203 transitions, 2221 flow [2022-01-19 04:29:51,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 52.0) internal successors, (572), 11 states have internal predecessors, (572), 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) [2022-01-19 04:29:51,498 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:51,499 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:51,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:51,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:51,716 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:51,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:51,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1233534911, now seen corresponding path program 3 times [2022-01-19 04:29:51,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:51,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003445479] [2022-01-19 04:29:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:51,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:51,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:51,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003445479] [2022-01-19 04:29:51,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003445479] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:51,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994368277] [2022-01-19 04:29:51,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:29:51,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:51,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:51,877 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) [2022-01-19 04:29:51,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 04:29:51,966 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:29:51,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:29:51,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-19 04:29:51,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:52,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:29:52,070 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:29:52,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:29:52,110 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:52,110 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:29:52,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:29:52,479 INFO L353 Elim1Store]: treesize reduction 81, result has 37.2 percent of original size [2022-01-19 04:29:52,479 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 85 [2022-01-19 04:29:52,483 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:52,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:52,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:52,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:29:52,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:52,646 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-01-19 04:29:52,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 04:29:52,703 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:52,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:52,738 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) is different from false [2022-01-19 04:29:52,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_542) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_543) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (not .cse0)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_540 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) .cse0))) is different from false [2022-01-19 04:29:52,835 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_542) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_543) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (not .cse0)) (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_540 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| v_ArrVal_540) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) .cse0))) is different from false [2022-01-19 04:29:52,841 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_542) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_543) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) is different from false [2022-01-19 04:29:52,864 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_542) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_543) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (= |c_thr1Thread1of1ForFork0_push_#t~mem4#1| 0)) is different from false [2022-01-19 04:29:52,872 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_542) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_543) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_545) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset|) 0))) (= (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-19 04:29:52,891 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:52,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:29:52,900 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:52,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:29:52,924 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-19 04:29:52,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-19 04:29:52,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-19 04:29:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-19 04:29:53,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994368277] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:53,073 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:53,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 12] total 34 [2022-01-19 04:29:53,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019981176] [2022-01-19 04:29:53,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:53,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-19 04:29:53,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-19 04:29:53,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=662, Unknown=6, NotChecked=342, Total=1122 [2022-01-19 04:29:53,081 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2022-01-19 04:29:53,082 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 203 transitions, 2221 flow. Second operand has 34 states, 34 states have (on average 43.911764705882355) internal successors, (1493), 34 states have internal predecessors, (1493), 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) [2022-01-19 04:29:53,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:53,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2022-01-19 04:29:53,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:53,567 INFO L129 PetriNetUnfolder]: 81/581 cut-off events. [2022-01-19 04:29:53,567 INFO L130 PetriNetUnfolder]: For 3119/3119 co-relation queries the response was YES. [2022-01-19 04:29:53,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2523 conditions, 581 events. 81/581 cut-off events. For 3119/3119 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2734 event pairs, 11 based on Foata normal form. 1/582 useless extension candidates. Maximal degree in co-relation 2463. Up to 287 conditions per place. [2022-01-19 04:29:53,573 INFO L132 encePairwiseOnDemand]: 80/97 looper letters, 121 selfloop transitions, 36 changer transitions 0/212 dead transitions. [2022-01-19 04:29:53,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 212 transitions, 2530 flow [2022-01-19 04:29:53,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 04:29:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 04:29:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 733 transitions. [2022-01-19 04:29:53,575 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4722938144329897 [2022-01-19 04:29:53,575 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 733 transitions. [2022-01-19 04:29:53,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 733 transitions. [2022-01-19 04:29:53,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:53,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 733 transitions. [2022-01-19 04:29:53,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 45.8125) internal successors, (733), 16 states have internal predecessors, (733), 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) [2022-01-19 04:29:53,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 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) [2022-01-19 04:29:53,578 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 97.0) internal successors, (1649), 17 states have internal predecessors, (1649), 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) [2022-01-19 04:29:53,579 INFO L186 Difference]: Start difference. First operand has 219 places, 203 transitions, 2221 flow. Second operand 16 states and 733 transitions. [2022-01-19 04:29:53,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 212 transitions, 2530 flow [2022-01-19 04:29:53,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 212 transitions, 2445 flow, removed 17 selfloop flow, removed 10 redundant places. [2022-01-19 04:29:53,606 INFO L242 Difference]: Finished difference. Result has 226 places, 202 transitions, 2186 flow [2022-01-19 04:29:53,607 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2059, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2186, PETRI_PLACES=226, PETRI_TRANSITIONS=202} [2022-01-19 04:29:53,608 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 135 predicate places. [2022-01-19 04:29:53,608 INFO L470 AbstractCegarLoop]: Abstraction has has 226 places, 202 transitions, 2186 flow [2022-01-19 04:29:53,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 43.911764705882355) internal successors, (1493), 34 states have internal predecessors, (1493), 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) [2022-01-19 04:29:53,609 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:53,609 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:53,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:53,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:53,827 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:53,827 INFO L85 PathProgramCache]: Analyzing trace with hash -918799434, now seen corresponding path program 1 times [2022-01-19 04:29:53,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:53,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840886830] [2022-01-19 04:29:53,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:53,828 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:53,967 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840886830] [2022-01-19 04:29:53,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840886830] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607014809] [2022-01-19 04:29:53,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:53,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:53,972 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:29:53,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 04:29:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:54,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 63 conjunts are in the unsatisfiable core [2022-01-19 04:29:54,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:54,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 04:29:54,685 INFO L353 Elim1Store]: treesize reduction 42, result has 35.4 percent of original size [2022-01-19 04:29:54,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 33 [2022-01-19 04:29:54,870 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:54,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2022-01-19 04:29:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:54,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:54,951 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| (store (select .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse1)) (or (forall ((v_ArrVal_639 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| v_ArrVal_639) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse1))) is different from false [2022-01-19 04:29:54,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| (store (select .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse1)) (or (forall ((v_ArrVal_639 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| v_ArrVal_639) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse1))) is different from false [2022-01-19 04:29:55,028 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| (store (select .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse1)) (or .cse1 (forall ((v_ArrVal_639 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| Int)) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_16| v_ArrVal_639) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))))) is different from false [2022-01-19 04:29:55,118 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:55,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:29:55,127 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:55,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:29:55,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 04:29:55,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2022-01-19 04:29:55,319 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:55,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-19 04:29:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-19 04:29:55,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607014809] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:55,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:55,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 31 [2022-01-19 04:29:55,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012576919] [2022-01-19 04:29:55,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:55,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-19 04:29:55,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:55,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-19 04:29:55,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=647, Unknown=3, NotChecked=162, Total=930 [2022-01-19 04:29:55,469 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 97 [2022-01-19 04:29:55,470 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 202 transitions, 2186 flow. Second operand has 31 states, 31 states have (on average 54.87096774193548) internal successors, (1701), 31 states have internal predecessors, (1701), 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) [2022-01-19 04:29:55,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:55,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 97 [2022-01-19 04:29:55,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:57,036 INFO L129 PetriNetUnfolder]: 111/843 cut-off events. [2022-01-19 04:29:57,036 INFO L130 PetriNetUnfolder]: For 4033/4033 co-relation queries the response was YES. [2022-01-19 04:29:57,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3591 conditions, 843 events. 111/843 cut-off events. For 4033/4033 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3980 event pairs, 3 based on Foata normal form. 12/855 useless extension candidates. Maximal degree in co-relation 3532. Up to 206 conditions per place. [2022-01-19 04:29:57,043 INFO L132 encePairwiseOnDemand]: 75/97 looper letters, 193 selfloop transitions, 134 changer transitions 0/380 dead transitions. [2022-01-19 04:29:57,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 380 transitions, 4125 flow [2022-01-19 04:29:57,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 04:29:57,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 04:29:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 3204 transitions. [2022-01-19 04:29:57,046 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5598462344923991 [2022-01-19 04:29:57,046 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 3204 transitions. [2022-01-19 04:29:57,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 3204 transitions. [2022-01-19 04:29:57,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:57,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 3204 transitions. [2022-01-19 04:29:57,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 54.30508474576271) internal successors, (3204), 59 states have internal predecessors, (3204), 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) [2022-01-19 04:29:57,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 97.0) internal successors, (5820), 60 states have internal predecessors, (5820), 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) [2022-01-19 04:29:57,056 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 97.0) internal successors, (5820), 60 states have internal predecessors, (5820), 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) [2022-01-19 04:29:57,056 INFO L186 Difference]: Start difference. First operand has 226 places, 202 transitions, 2186 flow. Second operand 59 states and 3204 transitions. [2022-01-19 04:29:57,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 380 transitions, 4125 flow [2022-01-19 04:29:57,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 380 transitions, 4095 flow, removed 3 selfloop flow, removed 8 redundant places. [2022-01-19 04:29:57,081 INFO L242 Difference]: Finished difference. Result has 308 places, 266 transitions, 3305 flow [2022-01-19 04:29:57,082 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=3305, PETRI_PLACES=308, PETRI_TRANSITIONS=266} [2022-01-19 04:29:57,082 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 217 predicate places. [2022-01-19 04:29:57,082 INFO L470 AbstractCegarLoop]: Abstraction has has 308 places, 266 transitions, 3305 flow [2022-01-19 04:29:57,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 54.87096774193548) internal successors, (1701), 31 states have internal predecessors, (1701), 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) [2022-01-19 04:29:57,083 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:57,083 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:29:57,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:57,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-19 04:29:57,298 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:57,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:57,298 INFO L85 PathProgramCache]: Analyzing trace with hash -635111308, now seen corresponding path program 1 times [2022-01-19 04:29:57,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:57,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168291610] [2022-01-19 04:29:57,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:57,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:57,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:57,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168291610] [2022-01-19 04:29:57,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168291610] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:57,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742851111] [2022-01-19 04:29:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:57,607 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:57,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:57,616 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:29:57,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-19 04:29:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:57,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 74 conjunts are in the unsatisfiable core [2022-01-19 04:29:57,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:57,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:29:57,914 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:29:57,915 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:29:57,953 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:29:57,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:29:58,220 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-01-19 04:29:58,257 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-19 04:29:58,330 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:58,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:29:58,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:29:58,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-01-19 04:29:58,748 INFO L353 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2022-01-19 04:29:58,749 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 74 [2022-01-19 04:29:58,793 INFO L353 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-01-19 04:29:58,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 113 [2022-01-19 04:29:58,799 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:29:59,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:29:59,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-01-19 04:29:59,398 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:29:59,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-01-19 04:29:59,607 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:29:59,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2022-01-19 04:29:59,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 23 [2022-01-19 04:29:59,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2022-01-19 04:29:59,901 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 04:29:59,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 19 [2022-01-19 04:29:59,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 33 treesize of output 26 [2022-01-19 04:29:59,967 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 42 [2022-01-19 04:29:59,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:29:59,983 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:00,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:00,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-19 04:30:00,183 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,184 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 23 [2022-01-19 04:30:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:00,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:30:00,275 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| Int) (v_ArrVal_749 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_749) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| Int) (v_ArrVal_752 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| v_ArrVal_752) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0))) is different from false [2022-01-19 04:30:00,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| Int) (v_ArrVal_752 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| v_ArrVal_752) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| Int) (v_ArrVal_749 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_749) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0)))) is different from false [2022-01-19 04:30:00,341 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| Int) (v_ArrVal_749 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_749) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| Int) (v_ArrVal_752 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| v_ArrVal_752) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0))) is different from false [2022-01-19 04:30:00,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| Int) (v_ArrVal_748 (Array Int Int)) (v_ArrVal_749 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_748))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_749) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_19|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2022-01-19 04:30:00,463 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,464 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:30:00,471 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,471 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:30:00,504 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,504 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 574 treesize of output 559 [2022-01-19 04:30:00,515 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,516 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 550 treesize of output 535 [2022-01-19 04:30:00,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 526 treesize of output 510 [2022-01-19 04:30:00,688 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-19 04:30:00,710 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,710 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 586 treesize of output 568 [2022-01-19 04:30:00,718 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 553 treesize of output 538 [2022-01-19 04:30:00,724 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 529 treesize of output 513 [2022-01-19 04:30:00,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 20 [2022-01-19 04:30:01,896 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:01,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 41 [2022-01-19 04:30:03,727 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-19 04:30:03,728 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1788 treesize of output 1782 [2022-01-19 04:30:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-01-19 04:30:03,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742851111] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:30:03,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:30:03,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 53 [2022-01-19 04:30:03,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817639823] [2022-01-19 04:30:03,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:30:03,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-19 04:30:03,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:30:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-19 04:30:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2068, Unknown=17, NotChecked=388, Total=2756 [2022-01-19 04:30:03,937 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2022-01-19 04:30:03,938 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 266 transitions, 3305 flow. Second operand has 53 states, 53 states have (on average 43.22641509433962) internal successors, (2291), 53 states have internal predecessors, (2291), 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) [2022-01-19 04:30:03,938 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:30:03,938 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2022-01-19 04:30:03,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:30:06,286 INFO L129 PetriNetUnfolder]: 141/1080 cut-off events. [2022-01-19 04:30:06,286 INFO L130 PetriNetUnfolder]: For 8104/8104 co-relation queries the response was YES. [2022-01-19 04:30:06,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5484 conditions, 1080 events. 141/1080 cut-off events. For 8104/8104 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5441 event pairs, 4 based on Foata normal form. 2/1082 useless extension candidates. Maximal degree in co-relation 5394. Up to 328 conditions per place. [2022-01-19 04:30:06,298 INFO L132 encePairwiseOnDemand]: 69/97 looper letters, 206 selfloop transitions, 163 changer transitions 0/415 dead transitions. [2022-01-19 04:30:06,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 415 transitions, 5502 flow [2022-01-19 04:30:06,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-01-19 04:30:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-01-19 04:30:06,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 2504 transitions. [2022-01-19 04:30:06,302 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.45288478929281967 [2022-01-19 04:30:06,302 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 2504 transitions. [2022-01-19 04:30:06,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 2504 transitions. [2022-01-19 04:30:06,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:30:06,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 2504 transitions. [2022-01-19 04:30:06,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 43.92982456140351) internal successors, (2504), 57 states have internal predecessors, (2504), 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) [2022-01-19 04:30:06,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 97.0) internal successors, (5626), 58 states have internal predecessors, (5626), 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) [2022-01-19 04:30:06,313 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 97.0) internal successors, (5626), 58 states have internal predecessors, (5626), 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) [2022-01-19 04:30:06,313 INFO L186 Difference]: Start difference. First operand has 308 places, 266 transitions, 3305 flow. Second operand 57 states and 2504 transitions. [2022-01-19 04:30:06,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 415 transitions, 5502 flow [2022-01-19 04:30:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 415 transitions, 5059 flow, removed 179 selfloop flow, removed 19 redundant places. [2022-01-19 04:30:06,384 INFO L242 Difference]: Finished difference. Result has 371 places, 344 transitions, 4432 flow [2022-01-19 04:30:06,384 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3008, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=4432, PETRI_PLACES=371, PETRI_TRANSITIONS=344} [2022-01-19 04:30:06,384 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 280 predicate places. [2022-01-19 04:30:06,385 INFO L470 AbstractCegarLoop]: Abstraction has has 371 places, 344 transitions, 4432 flow [2022-01-19 04:30:06,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 43.22641509433962) internal successors, (2291), 53 states have internal predecessors, (2291), 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) [2022-01-19 04:30:06,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:30:06,390 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:30:06,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-19 04:30:06,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:30:06,603 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:30:06,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:30:06,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1343586384, now seen corresponding path program 2 times [2022-01-19 04:30:06,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:30:06,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029145551] [2022-01-19 04:30:06,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:30:06,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:30:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:30:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:07,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:30:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029145551] [2022-01-19 04:30:07,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029145551] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:30:07,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455198748] [2022-01-19 04:30:07,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:30:07,001 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:30:07,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:30:07,007 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:30:07,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-19 04:30:07,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:30:07,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:30:07,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 94 conjunts are in the unsatisfiable core [2022-01-19 04:30:07,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:30:07,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:30:07,278 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:30:07,278 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:30:07,311 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:30:07,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:30:07,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:30:07,376 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-19 04:30:07,565 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-01-19 04:30:07,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-19 04:30:07,732 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:30:07,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:30:07,789 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:30:07,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-01-19 04:30:08,068 INFO L353 Elim1Store]: treesize reduction 42, result has 42.5 percent of original size [2022-01-19 04:30:08,068 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 74 [2022-01-19 04:30:08,108 INFO L353 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-01-19 04:30:08,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 113 [2022-01-19 04:30:08,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:30:08,645 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-19 04:30:08,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 17 [2022-01-19 04:30:08,758 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 19 [2022-01-19 04:30:08,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 90 treesize of output 83 [2022-01-19 04:30:08,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:30:08,830 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:30:08,850 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 04:30:08,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 16 [2022-01-19 04:30:09,008 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:09,009 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 23 [2022-01-19 04:30:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:09,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:30:09,073 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_859 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_859) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse0)) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| Int) (v_ArrVal_861 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| v_ArrVal_861) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0))) is different from false [2022-01-19 04:30:09,082 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_859 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_859) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| Int) (v_ArrVal_861 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| v_ArrVal_861) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0))) is different from false [2022-01-19 04:30:09,121 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_859 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| Int)) (not (= (select (select (store (store |c_#memory_int| |c_~#top~0.base| (store (select |c_#memory_int| |c_~#top~0.base|) |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| (store (select (store |c_#memory_int| |c_~#top~0.base| v_ArrVal_859) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1)) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| Int) (v_ArrVal_861 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| v_ArrVal_861) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0))) is different from false [2022-01-19 04:30:09,185 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_858))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_859) |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_22|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2022-01-19 04:30:09,221 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:09,222 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:30:09,228 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:09,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:30:09,243 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-19 04:30:09,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:09,259 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1171 treesize of output 1129 [2022-01-19 04:30:09,272 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:09,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1110 treesize of output 1071 [2022-01-19 04:30:09,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1062 treesize of output 1030 [2022-01-19 04:30:09,429 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-01-19 04:30:10,347 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:10,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 44 [2022-01-19 04:30:10,353 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:10,353 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-01-19 04:30:10,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-19 04:30:10,428 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2022-01-19 04:30:12,086 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-19 04:30:12,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1844 treesize of output 1838 [2022-01-19 04:30:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-01-19 04:30:12,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455198748] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:30:12,307 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:30:12,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 58 [2022-01-19 04:30:12,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688940623] [2022-01-19 04:30:12,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:30:12,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-01-19 04:30:12,308 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:30:12,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-01-19 04:30:12,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2536, Unknown=12, NotChecked=428, Total=3306 [2022-01-19 04:30:12,309 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2022-01-19 04:30:12,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 344 transitions, 4432 flow. Second operand has 58 states, 58 states have (on average 42.94827586206897) internal successors, (2491), 58 states have internal predecessors, (2491), 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) [2022-01-19 04:30:12,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:30:12,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2022-01-19 04:30:12,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:30:14,469 INFO L129 PetriNetUnfolder]: 141/1247 cut-off events. [2022-01-19 04:30:14,469 INFO L130 PetriNetUnfolder]: For 10178/10178 co-relation queries the response was YES. [2022-01-19 04:30:14,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6674 conditions, 1247 events. 141/1247 cut-off events. For 10178/10178 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6751 event pairs, 3 based on Foata normal form. 1/1248 useless extension candidates. Maximal degree in co-relation 6561. Up to 381 conditions per place. [2022-01-19 04:30:14,484 INFO L132 encePairwiseOnDemand]: 70/97 looper letters, 224 selfloop transitions, 195 changer transitions 0/465 dead transitions. [2022-01-19 04:30:14,484 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 465 transitions, 6566 flow [2022-01-19 04:30:14,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 04:30:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 04:30:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 2293 transitions. [2022-01-19 04:30:14,488 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.45459952418715305 [2022-01-19 04:30:14,488 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 2293 transitions. [2022-01-19 04:30:14,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 2293 transitions. [2022-01-19 04:30:14,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:30:14,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 2293 transitions. [2022-01-19 04:30:14,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 44.09615384615385) internal successors, (2293), 52 states have internal predecessors, (2293), 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) [2022-01-19 04:30:14,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 97.0) internal successors, (5141), 53 states have internal predecessors, (5141), 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) [2022-01-19 04:30:14,496 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 97.0) internal successors, (5141), 53 states have internal predecessors, (5141), 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) [2022-01-19 04:30:14,496 INFO L186 Difference]: Start difference. First operand has 371 places, 344 transitions, 4432 flow. Second operand 52 states and 2293 transitions. [2022-01-19 04:30:14,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 465 transitions, 6566 flow [2022-01-19 04:30:14,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 465 transitions, 6101 flow, removed 169 selfloop flow, removed 14 redundant places. [2022-01-19 04:30:14,581 INFO L242 Difference]: Finished difference. Result has 436 places, 401 transitions, 5544 flow [2022-01-19 04:30:14,581 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=4057, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=5544, PETRI_PLACES=436, PETRI_TRANSITIONS=401} [2022-01-19 04:30:14,581 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 345 predicate places. [2022-01-19 04:30:14,582 INFO L470 AbstractCegarLoop]: Abstraction has has 436 places, 401 transitions, 5544 flow [2022-01-19 04:30:14,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 42.94827586206897) internal successors, (2491), 58 states have internal predecessors, (2491), 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) [2022-01-19 04:30:14,582 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:30:14,582 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:30:14,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-19 04:30:14,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-19 04:30:14,795 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:30:14,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:30:14,796 INFO L85 PathProgramCache]: Analyzing trace with hash -859116036, now seen corresponding path program 3 times [2022-01-19 04:30:14,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:30:14,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086093807] [2022-01-19 04:30:14,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:30:14,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:30:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:30:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:15,097 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:30:15,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086093807] [2022-01-19 04:30:15,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086093807] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:30:15,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142168768] [2022-01-19 04:30:15,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:30:15,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:30:15,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:30:15,099 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:30:15,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-19 04:30:15,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-19 04:30:15,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:30:15,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 85 conjunts are in the unsatisfiable core [2022-01-19 04:30:15,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:30:15,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-19 04:30:15,364 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:30:15,364 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:30:15,396 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:30:15,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-19 04:30:15,590 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-01-19 04:30:15,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-01-19 04:30:15,682 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:30:15,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:30:15,744 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:30:15,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-19 04:30:15,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 17 [2022-01-19 04:30:16,099 INFO L353 Elim1Store]: treesize reduction 68, result has 41.9 percent of original size [2022-01-19 04:30:16,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 92 treesize of output 118 [2022-01-19 04:30:16,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 48 [2022-01-19 04:30:16,132 INFO L353 Elim1Store]: treesize reduction 62, result has 42.1 percent of original size [2022-01-19 04:30:16,132 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 93 treesize of output 129 [2022-01-19 04:30:16,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 142 treesize of output 132 [2022-01-19 04:30:16,807 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:16,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 85 [2022-01-19 04:30:16,844 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:16,995 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:17,071 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:17,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 96 [2022-01-19 04:30:17,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:17,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:17,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:17,432 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:17,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 164 [2022-01-19 04:30:24,094 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:30:24,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,122 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,126 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,130 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:24,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:30:24,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 1 [2022-01-19 04:30:24,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,190 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,229 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,232 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:24,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:30:24,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,241 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-01-19 04:30:24,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,247 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,252 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:24,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:30:24,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,274 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,277 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:24,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:30:24,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:24,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:30:24,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,422 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:24,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:30:24,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,432 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2022-01-19 04:30:24,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,442 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 04:30:24,449 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 1 [2022-01-19 04:30:24,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:24,453 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-19 04:30:25,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 04:30:25,173 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 27 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 429 treesize of output 481 [2022-01-19 04:30:25,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-01-19 04:30:25,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-01-19 04:30:25,329 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-01-19 04:30:25,339 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:30:25,384 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-19 04:30:25,402 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:25,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 133 [2022-01-19 04:30:27,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:27,379 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:27,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-01-19 04:30:27,383 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-19 04:30:27,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:30:27,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_966))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_967) |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2022-01-19 04:30:27,574 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_966))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_967) |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= |c_thr1Thread1of1ForFork0_push_#t~mem4#1| 0)) is different from false [2022-01-19 04:30:27,584 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_966 (Array Int Int)) (v_ArrVal_967 (Array Int Int)) (|thr1Thread1of1ForFork0_push_~#ret~0#1.base| Int)) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_966))) (store (store .cse0 |c_~#top~0.base| (store (select .cse0 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse0 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) |thr1Thread1of1ForFork0_push_~#ret~0#1.base| (store (select (store .cse0 |c_~#top~0.base| v_ArrVal_967) |thr1Thread1of1ForFork0_push_~#ret~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (= (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) is different from false [2022-01-19 04:30:27,599 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:27,600 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 45 [2022-01-19 04:30:27,610 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-01-19 04:30:27,620 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:27,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1166 treesize of output 1124 [2022-01-19 04:30:27,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1110 treesize of output 1078 [2022-01-19 04:30:27,635 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:27,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1078 treesize of output 1039 [2022-01-19 04:30:27,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:28,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-19 04:30:28,186 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 13 refuted. 3 times theorem prover too weak. 7 trivial. 16 not checked. [2022-01-19 04:30:28,186 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142168768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:30:28,187 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:30:28,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17, 18] total 44 [2022-01-19 04:30:28,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325574659] [2022-01-19 04:30:28,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:30:28,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-19 04:30:28,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:30:28,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-19 04:30:28,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1424, Unknown=23, NotChecked=240, Total=1892 [2022-01-19 04:30:28,190 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2022-01-19 04:30:28,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 401 transitions, 5544 flow. Second operand has 44 states, 44 states have (on average 43.20454545454545) internal successors, (1901), 44 states have internal predecessors, (1901), 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) [2022-01-19 04:30:28,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:30:28,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2022-01-19 04:30:28,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:30:29,350 INFO L129 PetriNetUnfolder]: 139/1644 cut-off events. [2022-01-19 04:30:29,350 INFO L130 PetriNetUnfolder]: For 14214/14214 co-relation queries the response was YES. [2022-01-19 04:30:29,381 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8995 conditions, 1644 events. 139/1644 cut-off events. For 14214/14214 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 10201 event pairs, 5 based on Foata normal form. 3/1647 useless extension candidates. Maximal degree in co-relation 8856. Up to 196 conditions per place. [2022-01-19 04:30:29,387 INFO L132 encePairwiseOnDemand]: 72/97 looper letters, 259 selfloop transitions, 245 changer transitions 0/565 dead transitions. [2022-01-19 04:30:29,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 468 places, 565 transitions, 8776 flow [2022-01-19 04:30:29,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 04:30:29,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 04:30:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1459 transitions. [2022-01-19 04:30:29,392 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4557950640424867 [2022-01-19 04:30:29,392 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 1459 transitions. [2022-01-19 04:30:29,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 1459 transitions. [2022-01-19 04:30:29,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:30:29,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 1459 transitions. [2022-01-19 04:30:29,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 44.21212121212121) internal successors, (1459), 33 states have internal predecessors, (1459), 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) [2022-01-19 04:30:29,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 97.0) internal successors, (3298), 34 states have internal predecessors, (3298), 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) [2022-01-19 04:30:29,397 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 97.0) internal successors, (3298), 34 states have internal predecessors, (3298), 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) [2022-01-19 04:30:29,397 INFO L186 Difference]: Start difference. First operand has 436 places, 401 transitions, 5544 flow. Second operand 33 states and 1459 transitions. [2022-01-19 04:30:29,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 468 places, 565 transitions, 8776 flow [2022-01-19 04:30:29,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 565 transitions, 8460 flow, removed 51 selfloop flow, removed 25 redundant places. [2022-01-19 04:30:29,513 INFO L242 Difference]: Finished difference. Result has 458 places, 496 transitions, 7693 flow [2022-01-19 04:30:29,514 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=5290, PETRI_DIFFERENCE_MINUEND_PLACES=411, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=156, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=7693, PETRI_PLACES=458, PETRI_TRANSITIONS=496} [2022-01-19 04:30:29,514 INFO L334 CegarLoopForPetriNet]: 91 programPoint places, 367 predicate places. [2022-01-19 04:30:29,514 INFO L470 AbstractCegarLoop]: Abstraction has has 458 places, 496 transitions, 7693 flow [2022-01-19 04:30:29,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 43.20454545454545) internal successors, (1901), 44 states have internal predecessors, (1901), 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) [2022-01-19 04:30:29,515 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:30:29,515 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 04:30:29,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-19 04:30:29,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-19 04:30:29,730 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:30:29,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:30:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1314555236, now seen corresponding path program 4 times [2022-01-19 04:30:29,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:30:29,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903273145] [2022-01-19 04:30:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:30:29,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:30:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:30:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:30,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:30:30,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903273145] [2022-01-19 04:30:30,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903273145] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:30:30,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066638546] [2022-01-19 04:30:30,105 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 04:30:30,105 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:30:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:30:30,108 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 04:30:30,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-19 04:30:30,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 04:30:30,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:30:30,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-19 04:30:30,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:30:30,288 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:30:30,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-19 04:30:30,663 INFO L353 Elim1Store]: treesize reduction 38, result has 47.9 percent of original size [2022-01-19 04:30:30,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 79 [2022-01-19 04:30:30,689 INFO L353 Elim1Store]: treesize reduction 60, result has 46.9 percent of original size [2022-01-19 04:30:30,690 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 107 [2022-01-19 04:30:30,694 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:30:30,762 INFO L353 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-01-19 04:30:30,763 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 29 [2022-01-19 04:30:30,819 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-19 04:30:30,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-01-19 04:30:30,936 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-19 04:30:30,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 60 [2022-01-19 04:30:31,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 72 treesize of output 69 [2022-01-19 04:30:31,965 WARN L220 Elim1Store]: Array PQE input equivalent to false [2022-01-19 04:30:32,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-01-19 04:30:32,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-19 04:30:32,044 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-01-19 04:30:32,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 11 [2022-01-19 04:30:32,450 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:32,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 22 [2022-01-19 04:30:32,468 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-19 04:30:32,468 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 8 [2022-01-19 04:30:32,640 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-19 04:30:32,640 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 49 treesize of output 55 [2022-01-19 04:30:45,304 WARN L228 SmtUtils]: Spent 12.47s on a formula simplification. DAG size of input: 57 DAG size of output: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 04:30:45,947 INFO L353 Elim1Store]: treesize reduction 72, result has 54.1 percent of original size [2022-01-19 04:30:45,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 126 treesize of output 182 [2022-01-19 04:30:45,951 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-19 04:30:45,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-19 04:30:46,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-19 04:30:46,155 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-19 04:30:46,161 INFO L158 Benchmark]: Toolchain (without parser) took 71446.02ms. Allocated memory was 377.5MB in the beginning and 824.2MB in the end (delta: 446.7MB). Free memory was 322.9MB in the beginning and 763.2MB in the end (delta: -440.3MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. [2022-01-19 04:30:46,161 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 377.5MB. Free memory was 340.9MB in the beginning and 340.8MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 04:30:46,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 703.75ms. Allocated memory is still 377.5MB. Free memory was 322.8MB in the beginning and 340.9MB in the end (delta: -18.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.0GB. [2022-01-19 04:30:46,162 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.16ms. Allocated memory is still 377.5MB. Free memory was 340.9MB in the beginning and 338.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:30:46,162 INFO L158 Benchmark]: Boogie Preprocessor took 32.79ms. Allocated memory is still 377.5MB. Free memory was 338.7MB in the beginning and 336.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 04:30:46,162 INFO L158 Benchmark]: RCFGBuilder took 361.14ms. Allocated memory is still 377.5MB. Free memory was 336.7MB in the beginning and 318.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 04:30:46,164 INFO L158 Benchmark]: TraceAbstraction took 70249.13ms. Allocated memory was 377.5MB in the beginning and 824.2MB in the end (delta: 446.7MB). Free memory was 318.9MB in the beginning and 763.2MB in the end (delta: -444.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.0GB. [2022-01-19 04:30:46,165 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.15ms. Allocated memory is still 377.5MB. Free memory was 340.9MB in the beginning and 340.8MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 703.75ms. Allocated memory is still 377.5MB. Free memory was 322.8MB in the beginning and 340.9MB in the end (delta: -18.1MB). Peak memory consumption was 18.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 88.16ms. Allocated memory is still 377.5MB. Free memory was 340.9MB in the beginning and 338.7MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 32.79ms. Allocated memory is still 377.5MB. Free memory was 338.7MB in the beginning and 336.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 361.14ms. Allocated memory is still 377.5MB. Free memory was 336.7MB in the beginning and 318.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 70249.13ms. Allocated memory was 377.5MB in the beginning and 824.2MB in the end (delta: 446.7MB). Free memory was 318.9MB in the beginning and 763.2MB in the end (delta: -444.4MB). Peak memory consumption was 4.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:108) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-19 04:30:46,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...