/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/37_stack_lock_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 04:29:49,674 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 04:29:49,676 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 04:29:49,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 04:29:49,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 04:29:49,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 04:29:49,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 04:29:49,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 04:29:49,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 04:29:49,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 04:29:49,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 04:29:49,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 04:29:49,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 04:29:49,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 04:29:49,752 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 04:29:49,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 04:29:49,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 04:29:49,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 04:29:49,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 04:29:49,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 04:29:49,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 04:29:49,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 04:29:49,769 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 04:29:49,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 04:29:49,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 04:29:49,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 04:29:49,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 04:29:49,777 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 04:29:49,777 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 04:29:49,778 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 04:29:49,778 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 04:29:49,779 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 04:29:49,780 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 04:29:49,781 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 04:29:49,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 04:29:49,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 04:29:49,782 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 04:29:49,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 04:29:49,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 04:29:49,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 04:29:49,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 04:29:49,785 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:49,814 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 04:29:49,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 04:29:49,815 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 04:29:49,815 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 04:29:49,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 04:29:49,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 04:29:49,816 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 04:29:49,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 04:29:49,816 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 04:29:49,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 04:29:49,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 04:29:49,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 04:29:49,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 04:29:49,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 04:29:49,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 04:29:49,819 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 04:29:49,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:29:49,819 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 04:29:49,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 04:29:49,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 04:29:49,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 04:29:49,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 04:29:49,819 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 04:29:49,820 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 04:29:49,820 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 04:29:49,820 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:50,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 04:29:50,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 04:29:50,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 04:29:50,054 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 04:29:50,054 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 04:29:50,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-01-19 04:29:50,102 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c31776b2/54ad05b59f3b46eca620daee954f6385/FLAGe231408f9 [2022-01-19 04:29:50,558 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 04:29:50,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/37_stack_lock_p0_vs_concur.i [2022-01-19 04:29:50,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c31776b2/54ad05b59f3b46eca620daee954f6385/FLAGe231408f9 [2022-01-19 04:29:50,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c31776b2/54ad05b59f3b46eca620daee954f6385 [2022-01-19 04:29:50,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 04:29:50,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 04:29:50,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 04:29:50,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 04:29:50,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 04:29:50,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:29:50" (1/1) ... [2022-01-19 04:29:50,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d41925a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:50, skipping insertion in model container [2022-01-19 04:29:50,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 04:29:50" (1/1) ... [2022-01-19 04:29:50,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 04:29:50,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 04:29:50,901 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/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-01-19 04:29:50,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:29:50,913 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 04:29:50,943 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/37_stack_lock_p0_vs_concur.i[30726,30739] [2022-01-19 04:29:50,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 04:29:50,984 INFO L208 MainTranslator]: Completed translation [2022-01-19 04:29:50,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:50 WrapperNode [2022-01-19 04:29:50,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 04:29:50,986 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 04:29:50,986 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 04:29:50,986 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 04:29:50,992 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:50" (1/1) ... [2022-01-19 04:29:51,006 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:50" (1/1) ... [2022-01-19 04:29:51,029 INFO L137 Inliner]: procedures = 171, calls = 26, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 83 [2022-01-19 04:29:51,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 04:29:51,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 04:29:51,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 04:29:51,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 04:29:51,036 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:50" (1/1) ... [2022-01-19 04:29:51,036 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:50" (1/1) ... [2022-01-19 04:29:51,051 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:50" (1/1) ... [2022-01-19 04:29:51,051 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:50" (1/1) ... [2022-01-19 04:29:51,056 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:50" (1/1) ... [2022-01-19 04:29:51,059 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:50" (1/1) ... [2022-01-19 04:29:51,060 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:50" (1/1) ... [2022-01-19 04:29:51,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 04:29:51,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 04:29:51,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 04:29:51,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 04:29:51,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:50" (1/1) ... [2022-01-19 04:29:51,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 04:29:51,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:51,107 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:51,115 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:51,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 04:29:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-01-19 04:29:51,145 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-01-19 04:29:51,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 04:29:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 04:29:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 04:29:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 04:29:51,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 04:29:51,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 04:29:51,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 04:29:51,152 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:51,239 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 04:29:51,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 04:29:51,424 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 04:29:51,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 04:29:51,481 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-19 04:29:51,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:29:51 BoogieIcfgContainer [2022-01-19 04:29:51,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 04:29:51,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 04:29:51,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 04:29:51,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 04:29:51,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 04:29:50" (1/3) ... [2022-01-19 04:29:51,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f461eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:29:51, skipping insertion in model container [2022-01-19 04:29:51,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 04:29:50" (2/3) ... [2022-01-19 04:29:51,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f461eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 04:29:51, skipping insertion in model container [2022-01-19 04:29:51,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 04:29:51" (3/3) ... [2022-01-19 04:29:51,497 INFO L111 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2022-01-19 04:29:51,501 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 04:29:51,502 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 04:29:51,502 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 04:29:51,553 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:51,553 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:51,553 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,553 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,555 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:51,555 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:51,555 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,555 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,555 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,556 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,557 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,558 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,558 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:51,558 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:51,558 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:51,558 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,559 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,559 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:51,559 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:51,559 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:51,559 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:51,559 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:51,559 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:51,561 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,561 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,561 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:51,561 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:51,561 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:51,562 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:51,562 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:51,562 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:51,562 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,562 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:51,562 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,563 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:51,563 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:51,563 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:51,563 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:51,564 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:51,564 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:51,564 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:51,565 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:51,565 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:51,565 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:51,565 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:51,565 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:51,565 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:51,565 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:51,565 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:51,565 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:51,567 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:51,567 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:51,567 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:51,567 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:51,568 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:51,568 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:51,568 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:51,568 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:51,568 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,569 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:51,569 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:51,569 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,569 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,569 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,569 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,570 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,570 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,570 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,570 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,570 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,570 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:51,570 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:51,570 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:51,571 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:51,571 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:51,571 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:51,571 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:51,571 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:51,571 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:51,572 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,572 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:51,572 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,572 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:51,572 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:51,572 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:51,572 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:51,572 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:51,572 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:51,573 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:51,573 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:51,573 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:51,575 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:51,575 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:51,575 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:51,576 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:51,576 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:51,578 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:51,582 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:51,583 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:51,583 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:51,584 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:51,584 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:51,585 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:51,585 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:51,585 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:51,585 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:51,585 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:51,585 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:51,585 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:51,585 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:51,586 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:51,586 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:51,586 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:51,586 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:51,586 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:51,586 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:51,586 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:51,586 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:51,586 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:51,587 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:51,587 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:51,587 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:51,587 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:51,587 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:51,587 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:51,587 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:51,587 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:51,588 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:51,588 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:51,588 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:51,588 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:51,588 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:51,590 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:51,591 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:51,591 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:51,591 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:51,591 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,591 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,591 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:51,591 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:51,591 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:51,591 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,593 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:51,593 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:51,593 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:51,594 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,594 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,594 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:51,594 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:29:51,594 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:51,594 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:51,596 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:29:51,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:29:51,655 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:51,656 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-01-19 04:29:51,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 79 transitions, 163 flow [2022-01-19 04:29:51,720 INFO L129 PetriNetUnfolder]: 7/90 cut-off events. [2022-01-19 04:29:51,720 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:29:51,723 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 90 events. 7/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2022-01-19 04:29:51,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 79 transitions, 163 flow [2022-01-19 04:29:51,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 79 transitions, 163 flow [2022-01-19 04:29:51,753 INFO L129 PetriNetUnfolder]: 6/87 cut-off events. [2022-01-19 04:29:51,754 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:29:51,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:51,754 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] [2022-01-19 04:29:51,755 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:51,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:51,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1986405927, now seen corresponding path program 1 times [2022-01-19 04:29:51,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:51,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144448619] [2022-01-19 04:29:51,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:51,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:52,031 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:52,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:52,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144448619] [2022-01-19 04:29:52,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144448619] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:29:52,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:29:52,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:29:52,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632366802] [2022-01-19 04:29:52,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:29:52,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:29:52,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:52,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:29:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:29:52,081 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 79 [2022-01-19 04:29:52,087 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 79 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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:52,087 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:52,087 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 79 [2022-01-19 04:29:52,088 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:52,149 INFO L129 PetriNetUnfolder]: 1/67 cut-off events. [2022-01-19 04:29:52,149 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-01-19 04:29:52,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 67 events. 1/67 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 27 event pairs, 0 based on Foata normal form. 12/77 useless extension candidates. Maximal degree in co-relation 51. Up to 5 conditions per place. [2022-01-19 04:29:52,151 INFO L132 encePairwiseOnDemand]: 70/79 looper letters, 4 selfloop transitions, 0 changer transitions 7/63 dead transitions. [2022-01-19 04:29:52,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 147 flow [2022-01-19 04:29:52,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 04:29:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 04:29:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 271 transitions. [2022-01-19 04:29:52,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8575949367088608 [2022-01-19 04:29:52,173 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 271 transitions. [2022-01-19 04:29:52,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 271 transitions. [2022-01-19 04:29:52,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:52,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 271 transitions. [2022-01-19 04:29:52,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 67.75) internal successors, (271), 4 states have internal predecessors, (271), 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:52,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 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:52,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 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:52,188 INFO L186 Difference]: Start difference. First operand has 76 places, 79 transitions, 163 flow. Second operand 4 states and 271 transitions. [2022-01-19 04:29:52,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 147 flow [2022-01-19 04:29:52,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 147 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:29:52,195 INFO L242 Difference]: Finished difference. Result has 68 places, 56 transitions, 117 flow [2022-01-19 04:29:52,196 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2022-01-19 04:29:52,200 INFO L334 CegarLoopForPetriNet]: 76 programPoint places, -8 predicate places. [2022-01-19 04:29:52,201 INFO L470 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 117 flow [2022-01-19 04:29:52,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 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:52,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:52,201 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] [2022-01-19 04:29:52,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 04:29:52,202 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:52,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1644178190, now seen corresponding path program 1 times [2022-01-19 04:29:52,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:52,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279582743] [2022-01-19 04:29:52,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:52,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:52,314 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:52,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:52,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279582743] [2022-01-19 04:29:52,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279582743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:29:52,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:29:52,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:29:52,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131001967] [2022-01-19 04:29:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:29:52,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:29:52,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:52,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:29:52,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:29:52,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 79 [2022-01-19 04:29:52,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 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:52,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:52,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 79 [2022-01-19 04:29:52,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:52,569 INFO L129 PetriNetUnfolder]: 32/207 cut-off events. [2022-01-19 04:29:52,569 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:29:52,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 207 events. 32/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 670 event pairs, 3 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 356. Up to 39 conditions per place. [2022-01-19 04:29:52,573 INFO L132 encePairwiseOnDemand]: 67/79 looper letters, 41 selfloop transitions, 22 changer transitions 12/107 dead transitions. [2022-01-19 04:29:52,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 107 transitions, 369 flow [2022-01-19 04:29:52,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:29:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:29:52,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 674 transitions. [2022-01-19 04:29:52,578 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6562804284323271 [2022-01-19 04:29:52,579 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 674 transitions. [2022-01-19 04:29:52,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 674 transitions. [2022-01-19 04:29:52,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:52,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 674 transitions. [2022-01-19 04:29:52,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 51.84615384615385) internal successors, (674), 13 states have internal predecessors, (674), 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:52,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 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:52,587 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 79.0) internal successors, (1106), 14 states have internal predecessors, (1106), 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:52,587 INFO L186 Difference]: Start difference. First operand has 68 places, 56 transitions, 117 flow. Second operand 13 states and 674 transitions. [2022-01-19 04:29:52,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 107 transitions, 369 flow [2022-01-19 04:29:52,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 107 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:29:52,591 INFO L242 Difference]: Finished difference. Result has 83 places, 75 transitions, 273 flow [2022-01-19 04:29:52,592 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=273, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2022-01-19 04:29:52,592 INFO L334 CegarLoopForPetriNet]: 76 programPoint places, 7 predicate places. [2022-01-19 04:29:52,593 INFO L470 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 273 flow [2022-01-19 04:29:52,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 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:52,593 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:52,594 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] [2022-01-19 04:29:52,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 04:29:52,594 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:52,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:52,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1361965498, now seen corresponding path program 1 times [2022-01-19 04:29:52,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:52,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719811126] [2022-01-19 04:29:52,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:52,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:52,910 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:52,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719811126] [2022-01-19 04:29:52,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719811126] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:52,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636198472] [2022-01-19 04:29:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:52,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:52,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:52,912 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:52,913 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:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:53,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-19 04:29:53,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:53,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, 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:53,242 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:53,242 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:53,278 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:53,421 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:53,442 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:53,475 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:53,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:53,501 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_59 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_59) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-19 04:29:53,586 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:53,586 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:53,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:53,599 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:53,632 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 24 treesize of output 20 [2022-01-19 04:29:53,636 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,652 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 36 treesize of output 28 [2022-01-19 04:29:53,661 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:54,052 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:54,104 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:54,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636198472] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:54,104 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:54,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-19 04:29:54,105 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85501133] [2022-01-19 04:29:54,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:54,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-19 04:29:54,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:54,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-19 04:29:54,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2022-01-19 04:29:54,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 79 [2022-01-19 04:29:54,131 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 273 flow. Second operand has 20 states, 20 states have (on average 41.3) internal successors, (826), 20 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:54,132 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:54,132 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 79 [2022-01-19 04:29:54,132 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:54,556 INFO L129 PetriNetUnfolder]: 33/302 cut-off events. [2022-01-19 04:29:54,556 INFO L130 PetriNetUnfolder]: For 143/143 co-relation queries the response was YES. [2022-01-19 04:29:54,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 757 conditions, 302 events. 33/302 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 888 event pairs, 5 based on Foata normal form. 1/303 useless extension candidates. Maximal degree in co-relation 741. Up to 49 conditions per place. [2022-01-19 04:29:54,559 INFO L132 encePairwiseOnDemand]: 65/79 looper letters, 60 selfloop transitions, 26 changer transitions 19/131 dead transitions. [2022-01-19 04:29:54,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 131 transitions, 723 flow [2022-01-19 04:29:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-19 04:29:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-01-19 04:29:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 810 transitions. [2022-01-19 04:29:54,562 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5396402398401066 [2022-01-19 04:29:54,562 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 810 transitions. [2022-01-19 04:29:54,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 810 transitions. [2022-01-19 04:29:54,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:54,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 810 transitions. [2022-01-19 04:29:54,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 42.63157894736842) internal successors, (810), 19 states have internal predecessors, (810), 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:54,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 79.0) internal successors, (1580), 20 states have internal predecessors, (1580), 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:54,568 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 79.0) internal successors, (1580), 20 states have internal predecessors, (1580), 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:54,568 INFO L186 Difference]: Start difference. First operand has 83 places, 75 transitions, 273 flow. Second operand 19 states and 810 transitions. [2022-01-19 04:29:54,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 131 transitions, 723 flow [2022-01-19 04:29:54,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 131 transitions, 713 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-01-19 04:29:54,574 INFO L242 Difference]: Finished difference. Result has 107 places, 86 transitions, 441 flow [2022-01-19 04:29:54,575 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=441, PETRI_PLACES=107, PETRI_TRANSITIONS=86} [2022-01-19 04:29:54,575 INFO L334 CegarLoopForPetriNet]: 76 programPoint places, 31 predicate places. [2022-01-19 04:29:54,576 INFO L470 AbstractCegarLoop]: Abstraction has has 107 places, 86 transitions, 441 flow [2022-01-19 04:29:54,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 41.3) internal successors, (826), 20 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:54,576 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:54,576 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, 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:54,606 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:54,800 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:54,801 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:54,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash 179684927, now seen corresponding path program 1 times [2022-01-19 04:29:54,802 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:54,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268734830] [2022-01-19 04:29:54,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:54,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:55,085 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:55,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:55,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268734830] [2022-01-19 04:29:55,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268734830] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:55,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742604689] [2022-01-19 04:29:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:55,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:55,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:55,087 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:55,088 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:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:55,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-19 04:29:55,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:55,222 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:55,307 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:29:55,308 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:55,328 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 6 treesize of output 5 [2022-01-19 04:29:55,462 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 19 treesize of output 19 [2022-01-19 04:29:55,529 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:55,529 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 13 treesize of output 13 [2022-01-19 04:29:55,562 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:55,623 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:55,682 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:55,721 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:55,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:29:55,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_116 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))) is different from false [2022-01-19 04:29:55,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)) (or .cse0 (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-19 04:29:56,888 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:56,888 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:56,911 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:29:56,912 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 52 [2022-01-19 04:29:56,918 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 65 treesize of output 57 [2022-01-19 04:29:56,922 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 52 treesize of output 50 [2022-01-19 04:29:56,926 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 50 treesize of output 48 [2022-01-19 04:29:56,930 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 48 treesize of output 46 [2022-01-19 04:29:57,862 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:29:57,863 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 48 treesize of output 48 [2022-01-19 04:29:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 18 refuted. 7 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-19 04:29:57,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742604689] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:29:57,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:29:57,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 30 [2022-01-19 04:29:57,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895470355] [2022-01-19 04:29:57,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:29:57,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-19 04:29:57,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:29:57,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-19 04:29:57,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=638, Unknown=19, NotChecked=106, Total=870 [2022-01-19 04:29:57,938 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 79 [2022-01-19 04:29:57,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 86 transitions, 441 flow. Second operand has 30 states, 30 states have (on average 41.766666666666666) internal successors, (1253), 30 states have internal predecessors, (1253), 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,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:29:57,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 79 [2022-01-19 04:29:57,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:29:58,565 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| 0) (not (= |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((v_ArrVal_112 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_112) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) .cse0))))) (= 3 (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))) is different from false [2022-01-19 04:29:58,654 WARN L838 $PredicateComparison]: unable to prove that (and (= 3 c_~top~0) (forall ((v_ArrVal_112 Int) (|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_112) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0)) (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_116 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| v_ArrVal_114) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) (not .cse0)) (or (forall ((v_ArrVal_116 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_116) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_28|) 0) 0))) .cse0)))))) is different from false [2022-01-19 04:29:58,796 INFO L129 PetriNetUnfolder]: 22/307 cut-off events. [2022-01-19 04:29:58,796 INFO L130 PetriNetUnfolder]: For 414/414 co-relation queries the response was YES. [2022-01-19 04:29:58,798 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 307 events. 22/307 cut-off events. For 414/414 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 782 event pairs, 9 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 881. Up to 60 conditions per place. [2022-01-19 04:29:58,799 INFO L132 encePairwiseOnDemand]: 60/79 looper letters, 50 selfloop transitions, 31 changer transitions 32/139 dead transitions. [2022-01-19 04:29:58,799 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 139 transitions, 897 flow [2022-01-19 04:29:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 04:29:58,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 04:29:58,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1360 transitions. [2022-01-19 04:29:58,803 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5216724204065977 [2022-01-19 04:29:58,803 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 1360 transitions. [2022-01-19 04:29:58,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 1360 transitions. [2022-01-19 04:29:58,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:29:58,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 1360 transitions. [2022-01-19 04:29:58,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 41.21212121212121) internal successors, (1360), 33 states have internal predecessors, (1360), 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:58,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 79.0) internal successors, (2686), 34 states have internal predecessors, (2686), 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:58,812 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 79.0) internal successors, (2686), 34 states have internal predecessors, (2686), 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:58,813 INFO L186 Difference]: Start difference. First operand has 107 places, 86 transitions, 441 flow. Second operand 33 states and 1360 transitions. [2022-01-19 04:29:58,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 139 transitions, 897 flow [2022-01-19 04:29:58,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 139 transitions, 863 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-01-19 04:29:58,820 INFO L242 Difference]: Finished difference. Result has 144 places, 96 transitions, 567 flow [2022-01-19 04:29:58,820 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=567, PETRI_PLACES=144, PETRI_TRANSITIONS=96} [2022-01-19 04:29:58,821 INFO L334 CegarLoopForPetriNet]: 76 programPoint places, 68 predicate places. [2022-01-19 04:29:58,821 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 96 transitions, 567 flow [2022-01-19 04:29:58,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 41.766666666666666) internal successors, (1253), 30 states have internal predecessors, (1253), 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:58,822 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:29:58,822 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-19 04:29:58,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 04:29:59,046 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:59,046 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:29:59,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:29:59,047 INFO L85 PathProgramCache]: Analyzing trace with hash 385552900, now seen corresponding path program 2 times [2022-01-19 04:29:59,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:29:59,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268268593] [2022-01-19 04:29:59,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:29:59,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:29:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:29:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:29:59,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:29:59,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268268593] [2022-01-19 04:29:59,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268268593] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:29:59,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418394948] [2022-01-19 04:29:59,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:29:59,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:29:59,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:29:59,632 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:59,660 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:59,740 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:29:59,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:29:59,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-19 04:29:59,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:29:59,782 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:59,850 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:29:59,851 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:59,870 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 6 treesize of output 5 [2022-01-19 04:29:59,984 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 19 treesize of output 19 [2022-01-19 04:30:00,050 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-19 04:30:00,050 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 19 treesize of output 23 [2022-01-19 04:30:00,095 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:30:00,272 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-19 04:30:00,273 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 16 treesize of output 22 [2022-01-19 04:30:00,437 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:30:00,449 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:00,449 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 15 treesize of output 19 [2022-01-19 04:30:00,562 INFO L353 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-01-19 04:30:00,563 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 26 treesize of output 25 [2022-01-19 04:30:00,874 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-19 04:30:00,875 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 22 treesize of output 31 [2022-01-19 04:30:00,925 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:30:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:00,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:30:00,966 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_196 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_196) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-19 04:30:00,994 WARN L838 $PredicateComparison]: unable to prove that (or (= 0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|) (forall ((v_ArrVal_196 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_196) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-19 04:30:01,001 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_196 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_196) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~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:30:01,068 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or .cse0 (forall ((v_ArrVal_196 (Array Int Int)) (v_ArrVal_193 Int)) (or (= v_ArrVal_193 0) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_193)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_196) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))))) (or (not .cse0) (forall ((v_ArrVal_194 (Array Int Int)) (v_ArrVal_196 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_196) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_194 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))))) is different from false [2022-01-19 04:30:01,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| Int) (v_ArrVal_192 Int)) (or (and (or (forall ((v_ArrVal_190 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| v_ArrVal_190) |c_ULTIMATE.start_main_~#t~0#1.base|) 0) 1) 0))) (not (< 64 c_~next_alloc_idx~0))) (not (= (+ (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base|) 0) 1) 0))) (not (= (select (store |c_#valid| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| v_ArrVal_192) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) is different from false [2022-01-19 04:30:01,846 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| Int) (v_ArrVal_187 Int) (v_ArrVal_192 Int)) (or (and (or (forall ((v_ArrVal_190 (Array Int Int))) (not (= (+ (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| v_ArrVal_190) |c_ULTIMATE.start_main_~#t~0#1.base|) 0) 1) 0))) (not (< 64 c_~next_alloc_idx~0))) (not (= (+ (select (select (store |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| (store (select |c_#memory_int| |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39|) 0 c_~next_alloc_idx~0)) |c_ULTIMATE.start_main_~#t~0#1.base|) 0) 1) 0))) (not (= (select (store (store |c_#valid| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_187) |v_thr1Thread1of1ForFork0_push_~#newTop~0#1.base_39| v_ArrVal_192) |c_ULTIMATE.start_main_~#t~0#1.base|) 0)))) is different from false [2022-01-19 04:30:02,324 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:02,324 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:02,347 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 28 treesize of output 24 [2022-01-19 04:30:02,360 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 26 treesize of output 22 [2022-01-19 04:30:03,571 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 46 treesize of output 44 [2022-01-19 04:30:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 65 not checked. [2022-01-19 04:30:03,636 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [418394948] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:30:03,636 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:30:03,636 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 45 [2022-01-19 04:30:03,636 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185916880] [2022-01-19 04:30:03,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:30:03,637 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-01-19 04:30:03,637 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:30:03,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-01-19 04:30:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1271, Unknown=7, NotChecked=474, Total=1980 [2022-01-19 04:30:03,639 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 79 [2022-01-19 04:30:03,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 96 transitions, 567 flow. Second operand has 45 states, 45 states have (on average 39.93333333333333) internal successors, (1797), 45 states have internal predecessors, (1797), 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,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:30:03,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 79 [2022-01-19 04:30:03,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:30:15,675 INFO L129 PetriNetUnfolder]: 25/365 cut-off events. [2022-01-19 04:30:15,675 INFO L130 PetriNetUnfolder]: For 657/657 co-relation queries the response was YES. [2022-01-19 04:30:15,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 365 events. 25/365 cut-off events. For 657/657 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1048 event pairs, 3 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 1201. Up to 50 conditions per place. [2022-01-19 04:30:15,679 INFO L132 encePairwiseOnDemand]: 59/79 looper letters, 66 selfloop transitions, 49 changer transitions 39/178 dead transitions. [2022-01-19 04:30:15,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 178 transitions, 1311 flow [2022-01-19 04:30:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 04:30:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 04:30:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1731 transitions. [2022-01-19 04:30:15,685 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4979861910241657 [2022-01-19 04:30:15,685 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 1731 transitions. [2022-01-19 04:30:15,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 1731 transitions. [2022-01-19 04:30:15,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:30:15,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1731 transitions. [2022-01-19 04:30:15,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 39.34090909090909) internal successors, (1731), 44 states have internal predecessors, (1731), 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:15,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 79.0) internal successors, (3555), 45 states have internal predecessors, (3555), 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:15,699 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 79.0) internal successors, (3555), 45 states have internal predecessors, (3555), 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:15,699 INFO L186 Difference]: Start difference. First operand has 144 places, 96 transitions, 567 flow. Second operand 44 states and 1731 transitions. [2022-01-19 04:30:15,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 178 transitions, 1311 flow [2022-01-19 04:30:15,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 178 transitions, 1235 flow, removed 23 selfloop flow, removed 20 redundant places. [2022-01-19 04:30:15,708 INFO L242 Difference]: Finished difference. Result has 171 places, 107 transitions, 726 flow [2022-01-19 04:30:15,709 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=513, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=726, PETRI_PLACES=171, PETRI_TRANSITIONS=107} [2022-01-19 04:30:15,712 INFO L334 CegarLoopForPetriNet]: 76 programPoint places, 95 predicate places. [2022-01-19 04:30:15,712 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 107 transitions, 726 flow [2022-01-19 04:30:15,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 39.93333333333333) internal successors, (1797), 45 states have internal predecessors, (1797), 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:15,713 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:30:15,713 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-19 04:30:15,739 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:30:15,936 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:30:15,937 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:30:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:30:15,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1355479052, now seen corresponding path program 3 times [2022-01-19 04:30:15,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:30:15,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443761754] [2022-01-19 04:30:15,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:30:15,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:30:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:30:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:16,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:30:16,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443761754] [2022-01-19 04:30:16,423 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443761754] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:30:16,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823239195] [2022-01-19 04:30:16,424 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:30:16,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:30:16,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:30:16,425 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:30:16,432 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:30:16,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-19 04:30:16,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:30:16,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-19 04:30:16,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:30:16,567 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:16,628 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:30:16,628 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:16,645 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 6 treesize of output 5 [2022-01-19 04:30:16,758 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 19 treesize of output 19 [2022-01-19 04:30:16,827 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-19 04:30:16,827 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 14 treesize of output 20 [2022-01-19 04:30:16,870 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:30:17,045 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-19 04:30:17,045 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 16 treesize of output 22 [2022-01-19 04:30:17,220 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:30:17,232 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:17,232 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 15 treesize of output 19 [2022-01-19 04:30:17,320 INFO L353 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-01-19 04:30:17,320 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 26 treesize of output 25 [2022-01-19 04:30:17,490 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-19 04:30:17,490 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 22 treesize of output 31 [2022-01-19 04:30:17,555 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:30:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:30:17,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:30:17,602 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_276 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_276) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-19 04:30:17,628 WARN L838 $PredicateComparison]: unable to prove that (or (= 0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|) (forall ((v_ArrVal_276 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_276) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-19 04:30:17,634 WARN L838 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0) (forall ((v_ArrVal_276 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_276) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)))) is different from false [2022-01-19 04:30:17,698 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 64 c_~next_alloc_idx~0))) (and (or (forall ((v_ArrVal_273 Int) (v_ArrVal_276 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset| v_ArrVal_273)) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_276) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= v_ArrVal_273 0))) .cse0) (or (forall ((v_ArrVal_274 (Array Int Int)) (v_ArrVal_276 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base| v_ArrVal_274) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_276) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0)) (= (select v_ArrVal_274 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (not .cse0)))) is different from false [2022-01-19 04:30:34,481 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:34,482 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:34,514 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 47 treesize of output 43 [2022-01-19 04:30:34,519 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 28 treesize of output 24 [2022-01-19 04:30:34,523 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 20 treesize of output 18 [2022-01-19 04:30:34,528 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 20 treesize of output 18 [2022-01-19 04:30:34,586 INFO L353 Elim1Store]: treesize reduction 24, result has 64.2 percent of original size [2022-01-19 04:30:34,588 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 5 case distinctions, treesize of input 98 treesize of output 104 [2022-01-19 04:30:34,606 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:34,606 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 77 treesize of output 77 [2022-01-19 04:30:34,624 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:30:34,624 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 82 treesize of output 78 [2022-01-19 04:30:34,631 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 60 treesize of output 58 [2022-01-19 04:30:34,636 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 58 treesize of output 54 [2022-01-19 04:30:34,643 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 54 treesize of output 52 [2022-01-19 04:30:36,002 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 62 treesize of output 60 [2022-01-19 04:30:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-01-19 04:30:36,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823239195] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:30:36,088 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:30:36,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 18] total 47 [2022-01-19 04:30:36,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500580836] [2022-01-19 04:30:36,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:30:36,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-01-19 04:30:36,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:30:36,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-01-19 04:30:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1537, Unknown=28, NotChecked=340, Total=2162 [2022-01-19 04:30:36,091 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 79 [2022-01-19 04:30:36,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 107 transitions, 726 flow. Second operand has 47 states, 47 states have (on average 39.765957446808514) internal successors, (1869), 47 states have internal predecessors, (1869), 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:36,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:30:36,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 79 [2022-01-19 04:30:36,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:01,736 INFO L129 PetriNetUnfolder]: 12/339 cut-off events. [2022-01-19 04:31:01,736 INFO L130 PetriNetUnfolder]: For 666/666 co-relation queries the response was YES. [2022-01-19 04:31:01,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 339 events. 12/339 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 662 event pairs, 1 based on Foata normal form. 1/340 useless extension candidates. Maximal degree in co-relation 1235. Up to 82 conditions per place. [2022-01-19 04:31:01,738 INFO L132 encePairwiseOnDemand]: 60/79 looper letters, 68 selfloop transitions, 44 changer transitions 17/153 dead transitions. [2022-01-19 04:31:01,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 153 transitions, 1271 flow [2022-01-19 04:31:01,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 04:31:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 04:31:01,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 1704 transitions. [2022-01-19 04:31:01,743 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4902186421173763 [2022-01-19 04:31:01,743 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 1704 transitions. [2022-01-19 04:31:01,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 1704 transitions. [2022-01-19 04:31:01,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:01,744 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 1704 transitions. [2022-01-19 04:31:01,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 38.72727272727273) internal successors, (1704), 44 states have internal predecessors, (1704), 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:31:01,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 79.0) internal successors, (3555), 45 states have internal predecessors, (3555), 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:31:01,751 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 79.0) internal successors, (3555), 45 states have internal predecessors, (3555), 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:31:01,751 INFO L186 Difference]: Start difference. First operand has 171 places, 107 transitions, 726 flow. Second operand 44 states and 1704 transitions. [2022-01-19 04:31:01,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 153 transitions, 1271 flow [2022-01-19 04:31:01,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 153 transitions, 1080 flow, removed 37 selfloop flow, removed 34 redundant places. [2022-01-19 04:31:01,760 INFO L242 Difference]: Finished difference. Result has 188 places, 117 transitions, 791 flow [2022-01-19 04:31:01,760 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=791, PETRI_PLACES=188, PETRI_TRANSITIONS=117} [2022-01-19 04:31:01,761 INFO L334 CegarLoopForPetriNet]: 76 programPoint places, 112 predicate places. [2022-01-19 04:31:01,761 INFO L470 AbstractCegarLoop]: Abstraction has has 188 places, 117 transitions, 791 flow [2022-01-19 04:31:01,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 39.765957446808514) internal successors, (1869), 47 states have internal predecessors, (1869), 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:31:01,762 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:01,762 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-01-19 04:31:01,788 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:31:01,979 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:31:01,980 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash -536224652, now seen corresponding path program 4 times [2022-01-19 04:31:01,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:01,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33926974] [2022-01-19 04:31:01,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:01,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 04:31:02,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:02,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33926974] [2022-01-19 04:31:02,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33926974] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:31:02,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303985691] [2022-01-19 04:31:02,460 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 04:31:02,460 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:31:02,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:31:02,462 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:31:02,463 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:31:02,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 04:31:02,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:31:02,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-19 04:31:02,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:31:02,578 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:31:02,630 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:31:02,630 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:31:02,716 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:31:02,743 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:31:02,743 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:31:02,815 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:31:02,838 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:31:02,838 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:31:02,887 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:31:02,903 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:31:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 04:31:02,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:31:02,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_348) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-19 04:31:02,960 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_348 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_348) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|) 0))) (= 0 |c_thr1Thread1of1ForFork0_push_#t~mem3#1|)) is different from false [2022-01-19 04:31:02,965 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 32 treesize of output 24 [2022-01-19 04:31:02,967 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 20 treesize of output 18 [2022-01-19 04:31:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 42 trivial. 10 not checked. [2022-01-19 04:31:03,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303985691] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:31:03,265 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:31:03,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 10, 10] total 29 [2022-01-19 04:31:03,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473367122] [2022-01-19 04:31:03,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:31:03,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-19 04:31:03,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:03,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-19 04:31:03,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=595, Unknown=2, NotChecked=102, Total=812 [2022-01-19 04:31:03,267 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 79 [2022-01-19 04:31:03,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 117 transitions, 791 flow. Second operand has 29 states, 29 states have (on average 40.48275862068966) internal successors, (1174), 29 states have internal predecessors, (1174), 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:31:03,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:03,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 79 [2022-01-19 04:31:03,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:03,994 INFO L129 PetriNetUnfolder]: 11/317 cut-off events. [2022-01-19 04:31:03,994 INFO L130 PetriNetUnfolder]: For 503/503 co-relation queries the response was YES. [2022-01-19 04:31:03,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1161 conditions, 317 events. 11/317 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 514 event pairs, 2 based on Foata normal form. 1/318 useless extension candidates. Maximal degree in co-relation 1121. Up to 71 conditions per place. [2022-01-19 04:31:03,996 INFO L132 encePairwiseOnDemand]: 66/79 looper letters, 0 selfloop transitions, 0 changer transitions 129/129 dead transitions. [2022-01-19 04:31:03,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 129 transitions, 1043 flow [2022-01-19 04:31:03,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-19 04:31:03,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-01-19 04:31:03,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 980 transitions. [2022-01-19 04:31:03,998 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4962025316455696 [2022-01-19 04:31:03,998 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 980 transitions. [2022-01-19 04:31:03,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 980 transitions. [2022-01-19 04:31:03,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:03,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 980 transitions. [2022-01-19 04:31:04,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 39.2) internal successors, (980), 25 states have internal predecessors, (980), 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:31:04,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 79.0) internal successors, (2054), 26 states have internal predecessors, (2054), 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:31:04,003 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 79.0) internal successors, (2054), 26 states have internal predecessors, (2054), 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:31:04,003 INFO L186 Difference]: Start difference. First operand has 188 places, 117 transitions, 791 flow. Second operand 25 states and 980 transitions. [2022-01-19 04:31:04,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 129 transitions, 1043 flow [2022-01-19 04:31:04,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 129 transitions, 948 flow, removed 12 selfloop flow, removed 28 redundant places. [2022-01-19 04:31:04,010 INFO L242 Difference]: Finished difference. Result has 178 places, 0 transitions, 0 flow [2022-01-19 04:31:04,011 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=0, PETRI_PLACES=178, PETRI_TRANSITIONS=0} [2022-01-19 04:31:04,011 INFO L334 CegarLoopForPetriNet]: 76 programPoint places, 102 predicate places. [2022-01-19 04:31:04,012 INFO L470 AbstractCegarLoop]: Abstraction has has 178 places, 0 transitions, 0 flow [2022-01-19 04:31:04,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 40.48275862068966) internal successors, (1174), 29 states have internal predecessors, (1174), 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:31:04,017 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-01-19 04:31:04,017 INFO L764 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-01-19 04:31:04,041 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:31:04,231 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:31:04,234 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2022-01-19 04:31:04,234 INFO L309 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2022-01-19 04:31:04,237 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2022-01-19 04:31:04,238 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:31:04,238 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-19 04:31:04,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 79 transitions, 163 flow [2022-01-19 04:31:04,245 INFO L129 PetriNetUnfolder]: 7/90 cut-off events. [2022-01-19 04:31:04,245 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:31:04,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 90 events. 7/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 60. Up to 4 conditions per place. [2022-01-19 04:31:04,245 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 79 transitions, 163 flow [2022-01-19 04:31:04,246 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 79 transitions, 163 flow [2022-01-19 04:31:04,249 INFO L129 PetriNetUnfolder]: 3/50 cut-off events. [2022-01-19 04:31:04,249 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-01-19 04:31:04,249 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:04,249 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] [2022-01-19 04:31:04,249 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [ULTIMATE.startErr0INUSE_VIOLATION] === [2022-01-19 04:31:04,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1475979099, now seen corresponding path program 1 times [2022-01-19 04:31:04,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:04,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775824664] [2022-01-19 04:31:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:04,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:04,258 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-19 04:31:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-19 04:31:04,277 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-19 04:31:04,278 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-19 04:31:04,278 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 1 remaining) [2022-01-19 04:31:04,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 04:31:04,278 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-01-19 04:31:04,278 INFO L309 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2022-01-19 04:31:04,279 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-01-19 04:31:04,279 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-01-19 04:31:04,291 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,291 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,291 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,291 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,292 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,293 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,294 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,295 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,296 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,297 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,298 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,298 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,299 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,300 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,301 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,302 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,303 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,304 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,304 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,304 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,304 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,304 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,305 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,305 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,305 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,305 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,305 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,305 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,305 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,306 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,307 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,308 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,309 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,310 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,311 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,312 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,313 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,316 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,316 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,316 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,317 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,318 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,319 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,320 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,321 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,321 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,321 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,321 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,321 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,321 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,321 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#in~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~d#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~oldTop~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_#in~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0___VERIFIER_atomic_index_malloc_~curr_alloc_idx#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,322 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,323 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_push_~#newTop~0#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,323 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 04:31:04,323 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-01-19 04:31:04,325 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 04:31:04,326 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:31:04,326 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 04:31:04,328 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 121 places, 127 transitions, 266 flow [2022-01-19 04:31:04,344 INFO L129 PetriNetUnfolder]: 13/151 cut-off events. [2022-01-19 04:31:04,344 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:31:04,345 INFO L84 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 151 events. 13/151 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 327 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 107. Up to 6 conditions per place. [2022-01-19 04:31:04,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 127 transitions, 266 flow [2022-01-19 04:31:04,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 127 transitions, 266 flow [2022-01-19 04:31:04,357 INFO L129 PetriNetUnfolder]: 8/128 cut-off events. [2022-01-19 04:31:04,357 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 04:31:04,357 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:04,357 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] [2022-01-19 04:31:04,357 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:04,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:04,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1538205864, now seen corresponding path program 1 times [2022-01-19 04:31:04,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:04,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123216202] [2022-01-19 04:31:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:04,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:04,386 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:31:04,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:04,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123216202] [2022-01-19 04:31:04,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123216202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:04,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:04,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:31:04,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063682800] [2022-01-19 04:31:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:04,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:31:04,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:31:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:31:04,389 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2022-01-19 04:31:04,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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:31:04,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:04,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2022-01-19 04:31:04,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:04,443 INFO L129 PetriNetUnfolder]: 37/330 cut-off events. [2022-01-19 04:31:04,444 INFO L130 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-01-19 04:31:04,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 330 events. 37/330 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1396 event pairs, 11 based on Foata normal form. 74/380 useless extension candidates. Maximal degree in co-relation 154. Up to 30 conditions per place. [2022-01-19 04:31:04,446 INFO L132 encePairwiseOnDemand]: 114/127 looper letters, 18 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2022-01-19 04:31:04,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 112 transitions, 286 flow [2022-01-19 04:31:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 04:31:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 04:31:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2022-01-19 04:31:04,447 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8877952755905512 [2022-01-19 04:31:04,447 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2022-01-19 04:31:04,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2022-01-19 04:31:04,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:04,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2022-01-19 04:31:04,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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:31:04,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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:31:04,449 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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:31:04,449 INFO L186 Difference]: Start difference. First operand has 121 places, 127 transitions, 266 flow. Second operand 4 states and 451 transitions. [2022-01-19 04:31:04,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 112 transitions, 286 flow [2022-01-19 04:31:04,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 112 transitions, 284 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:04,451 INFO L242 Difference]: Finished difference. Result has 109 places, 104 transitions, 222 flow [2022-01-19 04:31:04,451 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=109, PETRI_TRANSITIONS=104} [2022-01-19 04:31:04,453 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, -12 predicate places. [2022-01-19 04:31:04,453 INFO L470 AbstractCegarLoop]: Abstraction has has 109 places, 104 transitions, 222 flow [2022-01-19 04:31:04,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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:31:04,453 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:04,454 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] [2022-01-19 04:31:04,454 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 04:31:04,454 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:04,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:04,454 INFO L85 PathProgramCache]: Analyzing trace with hash -346194495, now seen corresponding path program 1 times [2022-01-19 04:31:04,454 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:04,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93635424] [2022-01-19 04:31:04,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:04,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:04,498 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:31:04,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:04,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93635424] [2022-01-19 04:31:04,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93635424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:04,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:04,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:31:04,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760652139] [2022-01-19 04:31:04,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:04,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:31:04,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:04,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:31:04,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:31:04,500 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 127 [2022-01-19 04:31:04,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 104 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:31:04,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:04,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 127 [2022-01-19 04:31:04,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:05,456 INFO L129 PetriNetUnfolder]: 2769/7351 cut-off events. [2022-01-19 04:31:05,457 INFO L130 PetriNetUnfolder]: For 163/163 co-relation queries the response was YES. [2022-01-19 04:31:05,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12192 conditions, 7351 events. 2769/7351 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 66649 event pairs, 557 based on Foata normal form. 0/6863 useless extension candidates. Maximal degree in co-relation 12103. Up to 1526 conditions per place. [2022-01-19 04:31:05,501 INFO L132 encePairwiseOnDemand]: 110/127 looper letters, 189 selfloop transitions, 52 changer transitions 0/306 dead transitions. [2022-01-19 04:31:05,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 306 transitions, 1163 flow [2022-01-19 04:31:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:31:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:31:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1236 transitions. [2022-01-19 04:31:05,503 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7486371895820715 [2022-01-19 04:31:05,503 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1236 transitions. [2022-01-19 04:31:05,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1236 transitions. [2022-01-19 04:31:05,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:05,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1236 transitions. [2022-01-19 04:31:05,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 95.07692307692308) internal successors, (1236), 13 states have internal predecessors, (1236), 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:31:05,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 127.0) internal successors, (1778), 14 states have internal predecessors, (1778), 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:31:05,509 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 127.0) internal successors, (1778), 14 states have internal predecessors, (1778), 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:31:05,509 INFO L186 Difference]: Start difference. First operand has 109 places, 104 transitions, 222 flow. Second operand 13 states and 1236 transitions. [2022-01-19 04:31:05,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 306 transitions, 1163 flow [2022-01-19 04:31:05,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 306 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:31:05,513 INFO L242 Difference]: Finished difference. Result has 131 places, 161 transitions, 631 flow [2022-01-19 04:31:05,514 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=631, PETRI_PLACES=131, PETRI_TRANSITIONS=161} [2022-01-19 04:31:05,514 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places. [2022-01-19 04:31:05,514 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 161 transitions, 631 flow [2022-01-19 04:31:05,515 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 04:31:05,515 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:05,515 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] [2022-01-19 04:31:05,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 04:31:05,515 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:05,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1576202355, now seen corresponding path program 1 times [2022-01-19 04:31:05,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:05,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774848347] [2022-01-19 04:31:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:05,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:05,540 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:31:05,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:05,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774848347] [2022-01-19 04:31:05,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774848347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:05,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:05,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 04:31:05,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902596287] [2022-01-19 04:31:05,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:05,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 04:31:05,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:05,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 04:31:05,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 04:31:05,544 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2022-01-19 04:31:05,544 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 161 transitions, 631 flow. Second operand has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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:31:05,544 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:05,544 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2022-01-19 04:31:05,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:05,862 INFO L129 PetriNetUnfolder]: 601/3159 cut-off events. [2022-01-19 04:31:05,863 INFO L130 PetriNetUnfolder]: For 2325/2480 co-relation queries the response was YES. [2022-01-19 04:31:05,878 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 3159 events. 601/3159 cut-off events. For 2325/2480 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 28595 event pairs, 105 based on Foata normal form. 36/3059 useless extension candidates. Maximal degree in co-relation 4739. Up to 384 conditions per place. [2022-01-19 04:31:05,891 INFO L132 encePairwiseOnDemand]: 124/127 looper letters, 33 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2022-01-19 04:31:05,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 169 transitions, 741 flow [2022-01-19 04:31:05,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 04:31:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 04:31:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-01-19 04:31:05,892 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8405511811023622 [2022-01-19 04:31:05,892 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2022-01-19 04:31:05,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2022-01-19 04:31:05,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:05,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2022-01-19 04:31:05,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 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:31:05,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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:31:05,894 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 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:31:05,894 INFO L186 Difference]: Start difference. First operand has 131 places, 161 transitions, 631 flow. Second operand 4 states and 427 transitions. [2022-01-19 04:31:05,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 169 transitions, 741 flow [2022-01-19 04:31:05,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 169 transitions, 741 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:05,902 INFO L242 Difference]: Finished difference. Result has 133 places, 159 transitions, 631 flow [2022-01-19 04:31:05,903 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=631, PETRI_PLACES=133, PETRI_TRANSITIONS=159} [2022-01-19 04:31:05,904 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 12 predicate places. [2022-01-19 04:31:05,904 INFO L470 AbstractCegarLoop]: Abstraction has has 133 places, 159 transitions, 631 flow [2022-01-19 04:31:05,904 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.75) internal successors, (415), 4 states have internal predecessors, (415), 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:31:05,904 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:05,904 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] [2022-01-19 04:31:05,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 04:31:05,905 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:05,905 INFO L85 PathProgramCache]: Analyzing trace with hash 755048041, now seen corresponding path program 1 times [2022-01-19 04:31:05,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:05,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486336240] [2022-01-19 04:31:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:05,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:06,012 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:31:06,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:06,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486336240] [2022-01-19 04:31:06,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486336240] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:31:06,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851104438] [2022-01-19 04:31:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:06,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:31:06,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:31:06,016 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:31:06,017 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:31:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:06,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-19 04:31:06,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:31:06,110 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:31:06,178 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:31:06,179 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:31:06,200 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:31:06,275 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:31:06,307 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:31:06,331 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:31:06,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:31:06,353 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_426 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_426) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-19 04:31:06,388 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:31:06,388 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:31:06,393 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:31:06,393 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:31:06,408 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 24 treesize of output 20 [2022-01-19 04:31:06,420 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:31:06,431 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 36 treesize of output 28 [2022-01-19 04:31:06,436 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:31:06,634 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:31:06,670 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:31:06,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851104438] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:31:06,671 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:31:06,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-19 04:31:06,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602988200] [2022-01-19 04:31:06,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:31:06,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-19 04:31:06,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:06,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-19 04:31:06,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=283, Unknown=1, NotChecked=34, Total=380 [2022-01-19 04:31:06,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2022-01-19 04:31:06,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 159 transitions, 631 flow. Second operand has 20 states, 20 states have (on average 69.2) internal successors, (1384), 20 states have internal predecessors, (1384), 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:31:06,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:06,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2022-01-19 04:31:06,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:10,429 INFO L129 PetriNetUnfolder]: 9485/23340 cut-off events. [2022-01-19 04:31:10,429 INFO L130 PetriNetUnfolder]: For 25166/25303 co-relation queries the response was YES. [2022-01-19 04:31:10,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57779 conditions, 23340 events. 9485/23340 cut-off events. For 25166/25303 co-relation queries the response was YES. Maximal size of possible extension queue 659. Compared 244735 event pairs, 855 based on Foata normal form. 221/23202 useless extension candidates. Maximal degree in co-relation 56484. Up to 3043 conditions per place. [2022-01-19 04:31:10,635 INFO L132 encePairwiseOnDemand]: 106/127 looper letters, 720 selfloop transitions, 292 changer transitions 0/1067 dead transitions. [2022-01-19 04:31:10,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 1067 transitions, 6727 flow [2022-01-19 04:31:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-01-19 04:31:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2022-01-19 04:31:10,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4197 transitions. [2022-01-19 04:31:10,643 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6355239248940037 [2022-01-19 04:31:10,643 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4197 transitions. [2022-01-19 04:31:10,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4197 transitions. [2022-01-19 04:31:10,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:10,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4197 transitions. [2022-01-19 04:31:10,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 80.71153846153847) internal successors, (4197), 52 states have internal predecessors, (4197), 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:31:10,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 127.0) internal successors, (6731), 53 states have internal predecessors, (6731), 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:31:10,772 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 127.0) internal successors, (6731), 53 states have internal predecessors, (6731), 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:31:10,773 INFO L186 Difference]: Start difference. First operand has 133 places, 159 transitions, 631 flow. Second operand 52 states and 4197 transitions. [2022-01-19 04:31:10,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 1067 transitions, 6727 flow [2022-01-19 04:31:10,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 1067 transitions, 6724 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 04:31:10,877 INFO L242 Difference]: Finished difference. Result has 213 places, 480 transitions, 3852 flow [2022-01-19 04:31:10,878 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=3852, PETRI_PLACES=213, PETRI_TRANSITIONS=480} [2022-01-19 04:31:10,878 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 92 predicate places. [2022-01-19 04:31:10,879 INFO L470 AbstractCegarLoop]: Abstraction has has 213 places, 480 transitions, 3852 flow [2022-01-19 04:31:10,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 69.2) internal successors, (1384), 20 states have internal predecessors, (1384), 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:31:10,880 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:10,880 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] [2022-01-19 04:31:10,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-01-19 04:31:11,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:31:11,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:11,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2027890772, now seen corresponding path program 1 times [2022-01-19 04:31:11,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:11,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240993717] [2022-01-19 04:31:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:11,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:31:11,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:11,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240993717] [2022-01-19 04:31:11,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240993717] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 04:31:11,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 04:31:11,142 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 04:31:11,142 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94561824] [2022-01-19 04:31:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 04:31:11,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 04:31:11,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 04:31:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 04:31:11,144 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 127 [2022-01-19 04:31:11,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 480 transitions, 3852 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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:31:11,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:11,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 127 [2022-01-19 04:31:11,145 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:17,211 INFO L129 PetriNetUnfolder]: 15022/37101 cut-off events. [2022-01-19 04:31:17,211 INFO L130 PetriNetUnfolder]: For 173687/174360 co-relation queries the response was YES. [2022-01-19 04:31:17,524 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119517 conditions, 37101 events. 15022/37101 cut-off events. For 173687/174360 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 414493 event pairs, 1502 based on Foata normal form. 496/36837 useless extension candidates. Maximal degree in co-relation 112698. Up to 9133 conditions per place. [2022-01-19 04:31:17,688 INFO L132 encePairwiseOnDemand]: 110/127 looper letters, 748 selfloop transitions, 647 changer transitions 0/1537 dead transitions. [2022-01-19 04:31:17,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 1537 transitions, 15753 flow [2022-01-19 04:31:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 04:31:17,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 04:31:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1224 transitions. [2022-01-19 04:31:17,697 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7413688673531194 [2022-01-19 04:31:17,697 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1224 transitions. [2022-01-19 04:31:17,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1224 transitions. [2022-01-19 04:31:17,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:17,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1224 transitions. [2022-01-19 04:31:17,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 94.15384615384616) internal successors, (1224), 13 states have internal predecessors, (1224), 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:31:17,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 127.0) internal successors, (1778), 14 states have internal predecessors, (1778), 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:31:17,708 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 127.0) internal successors, (1778), 14 states have internal predecessors, (1778), 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:31:17,708 INFO L186 Difference]: Start difference. First operand has 213 places, 480 transitions, 3852 flow. Second operand 13 states and 1224 transitions. [2022-01-19 04:31:17,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 1537 transitions, 15753 flow [2022-01-19 04:31:19,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 1537 transitions, 15355 flow, removed 198 selfloop flow, removed 1 redundant places. [2022-01-19 04:31:19,016 INFO L242 Difference]: Finished difference. Result has 236 places, 1167 transitions, 13164 flow [2022-01-19 04:31:19,016 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=3726, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=13164, PETRI_PLACES=236, PETRI_TRANSITIONS=1167} [2022-01-19 04:31:19,017 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 115 predicate places. [2022-01-19 04:31:19,017 INFO L470 AbstractCegarLoop]: Abstraction has has 236 places, 1167 transitions, 13164 flow [2022-01-19 04:31:19,017 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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:31:19,017 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:19,017 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:19,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 04:31:19,018 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:19,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:19,018 INFO L85 PathProgramCache]: Analyzing trace with hash 960317588, now seen corresponding path program 2 times [2022-01-19 04:31:19,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:19,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378441737] [2022-01-19 04:31:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:19,019 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:19,128 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:31:19,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:19,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378441737] [2022-01-19 04:31:19,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378441737] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:31:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579720539] [2022-01-19 04:31:19,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 04:31:19,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:31:19,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:31:19,130 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:31:19,131 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:31:19,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 04:31:19,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:31:19,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-19 04:31:19,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:31:19,248 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:31:19,331 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:31:19,332 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:31:19,354 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:31:19,456 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:31:19,471 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:31:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:31:19,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:31:19,513 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_480 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_480) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-19 04:31:19,563 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:31:19,564 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:31:19,570 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:31:19,570 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:31:19,589 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 24 treesize of output 20 [2022-01-19 04:31:19,594 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:31:19,601 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 36 treesize of output 28 [2022-01-19 04:31:19,608 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:31:20,007 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:31:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2022-01-19 04:31:20,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579720539] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:31:20,054 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:31:20,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-19 04:31:20,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397406292] [2022-01-19 04:31:20,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:31:20,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-19 04:31:20,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:20,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-19 04:31:20,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2022-01-19 04:31:20,057 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2022-01-19 04:31:20,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1167 transitions, 13164 flow. Second operand has 20 states, 20 states have (on average 69.4) internal successors, (1388), 20 states have internal predecessors, (1388), 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:31:20,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:20,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2022-01-19 04:31:20,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:31:20,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base| |c_ULTIMATE.start_main_~#t~0#1.base|))) (and (forall ((v_ArrVal_480 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_480) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| 0) (not .cse0)) (or (= |c_thr1Thread2of2ForFork0_push_#t~mem3#1| (select (select |c_#memory_int| |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|)) .cse0))) is different from false [2022-01-19 04:31:36,340 INFO L129 PetriNetUnfolder]: 26388/63375 cut-off events. [2022-01-19 04:31:36,340 INFO L130 PetriNetUnfolder]: For 353316/354081 co-relation queries the response was YES. [2022-01-19 04:31:37,213 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244484 conditions, 63375 events. 26388/63375 cut-off events. For 353316/354081 co-relation queries the response was YES. Maximal size of possible extension queue 1757. Compared 750415 event pairs, 4592 based on Foata normal form. 496/63400 useless extension candidates. Maximal degree in co-relation 235573. Up to 23763 conditions per place. [2022-01-19 04:31:37,459 INFO L132 encePairwiseOnDemand]: 98/127 looper letters, 1675 selfloop transitions, 1152 changer transitions 5/2965 dead transitions. [2022-01-19 04:31:37,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 2965 transitions, 37794 flow [2022-01-19 04:31:37,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 04:31:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 04:31:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3703 transitions. [2022-01-19 04:31:37,463 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6203719215949071 [2022-01-19 04:31:37,463 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3703 transitions. [2022-01-19 04:31:37,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3703 transitions. [2022-01-19 04:31:37,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:31:37,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3703 transitions. [2022-01-19 04:31:37,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 78.7872340425532) internal successors, (3703), 47 states have internal predecessors, (3703), 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:31:37,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 127.0) internal successors, (6096), 48 states have internal predecessors, (6096), 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:31:37,475 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 127.0) internal successors, (6096), 48 states have internal predecessors, (6096), 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:31:37,476 INFO L186 Difference]: Start difference. First operand has 236 places, 1167 transitions, 13164 flow. Second operand 47 states and 3703 transitions. [2022-01-19 04:31:37,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 2965 transitions, 37794 flow [2022-01-19 04:31:44,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 2965 transitions, 37432 flow, removed 181 selfloop flow, removed 0 redundant places. [2022-01-19 04:31:44,836 INFO L242 Difference]: Finished difference. Result has 310 places, 2181 transitions, 30598 flow [2022-01-19 04:31:44,837 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=13028, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=294, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=30598, PETRI_PLACES=310, PETRI_TRANSITIONS=2181} [2022-01-19 04:31:44,838 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 189 predicate places. [2022-01-19 04:31:44,838 INFO L470 AbstractCegarLoop]: Abstraction has has 310 places, 2181 transitions, 30598 flow [2022-01-19 04:31:44,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 69.4) internal successors, (1388), 20 states have internal predecessors, (1388), 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:31:44,839 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:31:44,839 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2022-01-19 04:31:44,864 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:31:45,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:31:45,044 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:31:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:31:45,044 INFO L85 PathProgramCache]: Analyzing trace with hash -2133521836, now seen corresponding path program 3 times [2022-01-19 04:31:45,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:31:45,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833854692] [2022-01-19 04:31:45,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:31:45,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:31:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:31:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:31:45,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:31:45,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833854692] [2022-01-19 04:31:45,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833854692] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:31:45,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893212577] [2022-01-19 04:31:45,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 04:31:45,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:31:45,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:31:45,152 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:31:45,156 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:31:45,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 04:31:45,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 04:31:45,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-19 04:31:45,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:31:45,263 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:31:45,352 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:31:45,352 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:31:45,384 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:31:45,454 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:31:45,499 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:31:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:31:45,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:31:45,552 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_519 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_519) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of2ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2022-01-19 04:31:45,575 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:31:45,575 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:31:45,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:31:45,580 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:31:45,595 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 24 treesize of output 20 [2022-01-19 04:31:45,598 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:31:45,604 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 36 treesize of output 28 [2022-01-19 04:31:45,608 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:31:45,893 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:31:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2022-01-19 04:31:45,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893212577] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:31:45,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:31:45,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-19 04:31:45,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001534910] [2022-01-19 04:31:45,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:31:45,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-19 04:31:45,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:31:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-19 04:31:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=286, Unknown=1, NotChecked=34, Total=380 [2022-01-19 04:31:45,933 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 127 [2022-01-19 04:31:45,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 2181 transitions, 30598 flow. Second operand has 20 states, 20 states have (on average 69.15) internal successors, (1383), 20 states have internal predecessors, (1383), 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:31:45,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:31:45,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 127 [2022-01-19 04:31:45,934 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:32:27,450 INFO L129 PetriNetUnfolder]: 40741/98488 cut-off events. [2022-01-19 04:32:27,450 INFO L130 PetriNetUnfolder]: For 823582/825087 co-relation queries the response was YES. [2022-01-19 04:32:29,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 450556 conditions, 98488 events. 40741/98488 cut-off events. For 823582/825087 co-relation queries the response was YES. Maximal size of possible extension queue 2751. Compared 1230676 event pairs, 4093 based on Foata normal form. 1024/98907 useless extension candidates. Maximal degree in co-relation 445476. Up to 16282 conditions per place. [2022-01-19 04:32:29,932 INFO L132 encePairwiseOnDemand]: 98/127 looper letters, 2197 selfloop transitions, 2567 changer transitions 55/4952 dead transitions. [2022-01-19 04:32:29,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 4952 transitions, 76367 flow [2022-01-19 04:32:29,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-01-19 04:32:29,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2022-01-19 04:32:29,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 5520 transitions. [2022-01-19 04:32:30,061 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6299212598425197 [2022-01-19 04:32:30,061 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 5520 transitions. [2022-01-19 04:32:30,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 5520 transitions. [2022-01-19 04:32:30,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:32:30,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 5520 transitions. [2022-01-19 04:32:30,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 80.0) internal successors, (5520), 69 states have internal predecessors, (5520), 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:32:30,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 127.0) internal successors, (8890), 70 states have internal predecessors, (8890), 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:32:30,087 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 127.0) internal successors, (8890), 70 states have internal predecessors, (8890), 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:32:30,087 INFO L186 Difference]: Start difference. First operand has 310 places, 2181 transitions, 30598 flow. Second operand 69 states and 5520 transitions. [2022-01-19 04:32:30,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 4952 transitions, 76367 flow [2022-01-19 04:32:49,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 4952 transitions, 75485 flow, removed 440 selfloop flow, removed 1 redundant places. [2022-01-19 04:32:49,610 INFO L242 Difference]: Finished difference. Result has 427 places, 3571 transitions, 61038 flow [2022-01-19 04:32:49,611 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=29775, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1335, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=69, PETRI_FLOW=61038, PETRI_PLACES=427, PETRI_TRANSITIONS=3571} [2022-01-19 04:32:49,612 INFO L334 CegarLoopForPetriNet]: 121 programPoint places, 306 predicate places. [2022-01-19 04:32:49,612 INFO L470 AbstractCegarLoop]: Abstraction has has 427 places, 3571 transitions, 61038 flow [2022-01-19 04:32:49,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 69.15) internal successors, (1383), 20 states have internal predecessors, (1383), 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:32:49,612 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 04:32:49,612 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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:32:49,635 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:32:49,835 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,SelfDestructingSolverStorable14 [2022-01-19 04:32:49,836 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-19 04:32:49,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 04:32:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1919936356, now seen corresponding path program 1 times [2022-01-19 04:32:49,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 04:32:49,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613688056] [2022-01-19 04:32:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:32:49,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 04:32:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:32:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:32:49,959 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 04:32:49,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613688056] [2022-01-19 04:32:49,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613688056] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 04:32:49,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546873197] [2022-01-19 04:32:49,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 04:32:49,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 04:32:49,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 04:32:49,961 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:32:49,962 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:32:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 04:32:50,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-19 04:32:50,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 04:32:50,089 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:32:50,169 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-19 04:32:50,169 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:32:50,239 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 6 treesize of output 5 [2022-01-19 04:32:50,268 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-19 04:32:50,268 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:32:50,298 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:32:50,365 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:32:50,427 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:32:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:32:50,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 04:32:50,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:32:50,679 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:32:50,691 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 04:32:50,692 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-01-19 04:32:50,694 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 33 treesize of output 25 [2022-01-19 04:32:51,233 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:32:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-19 04:32:51,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546873197] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 04:32:51,299 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 04:32:51,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-01-19 04:32:51,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707650809] [2022-01-19 04:32:51,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 04:32:51,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 04:32:51,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 04:32:51,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 04:32:51,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=648, Unknown=3, NotChecked=0, Total=756 [2022-01-19 04:32:51,302 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 127 [2022-01-19 04:32:51,303 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 3571 transitions, 61038 flow. Second operand has 28 states, 28 states have (on average 68.03571428571429) internal successors, (1905), 28 states have internal predecessors, (1905), 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:32:51,303 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 04:32:51,303 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 127 [2022-01-19 04:32:51,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 04:36:22,594 INFO L129 PetriNetUnfolder]: 113544/272288 cut-off events. [2022-01-19 04:36:22,594 INFO L130 PetriNetUnfolder]: For 3949757/3954313 co-relation queries the response was YES. [2022-01-19 04:36:32,897 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1535861 conditions, 272288 events. 113544/272288 cut-off events. For 3949757/3954313 co-relation queries the response was YES. Maximal size of possible extension queue 7130. Compared 3840057 event pairs, 9911 based on Foata normal form. 3260/273248 useless extension candidates. Maximal degree in co-relation 1523664. Up to 47749 conditions per place. [2022-01-19 04:36:34,729 INFO L132 encePairwiseOnDemand]: 93/127 looper letters, 7528 selfloop transitions, 8458 changer transitions 33/16151 dead transitions. [2022-01-19 04:36:34,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 16151 transitions, 316711 flow [2022-01-19 04:36:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2022-01-19 04:36:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2022-01-19 04:36:34,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 10232 transitions. [2022-01-19 04:36:34,757 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6150147262126585 [2022-01-19 04:36:34,758 INFO L72 ComplementDD]: Start complementDD. Operand 131 states and 10232 transitions. [2022-01-19 04:36:34,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 10232 transitions. [2022-01-19 04:36:34,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 04:36:34,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 131 states and 10232 transitions. [2022-01-19 04:36:34,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 132 states, 131 states have (on average 78.10687022900764) internal successors, (10232), 131 states have internal predecessors, (10232), 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:36:34,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 132 states, 132 states have (on average 127.0) internal successors, (16764), 132 states have internal predecessors, (16764), 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:36:34,818 INFO L81 ComplementDD]: Finished complementDD. Result has 132 states, 132 states have (on average 127.0) internal successors, (16764), 132 states have internal predecessors, (16764), 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:36:34,818 INFO L186 Difference]: Start difference. First operand has 427 places, 3571 transitions, 61038 flow. Second operand 131 states and 10232 transitions. [2022-01-19 04:36:34,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 16151 transitions, 316711 flow