/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-McrStrategy.epf -i ../../../trunk/examples/svcomp/pthread/queue_ok_longer.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b981219 [2020-04-18 07:31:51,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-04-18 07:31:51,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-04-18 07:31:51,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-04-18 07:31:51,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-04-18 07:31:51,024 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-04-18 07:31:51,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-04-18 07:31:51,027 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-04-18 07:31:51,029 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-04-18 07:31:51,030 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-04-18 07:31:51,031 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-04-18 07:31:51,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-04-18 07:31:51,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-04-18 07:31:51,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-04-18 07:31:51,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-04-18 07:31:51,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-04-18 07:31:51,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-04-18 07:31:51,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-04-18 07:31:51,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-04-18 07:31:51,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-04-18 07:31:51,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-04-18 07:31:51,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-04-18 07:31:51,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-04-18 07:31:51,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-04-18 07:31:51,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-04-18 07:31:51,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-04-18 07:31:51,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-04-18 07:31:51,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-04-18 07:31:51,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-04-18 07:31:51,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-04-18 07:31:51,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-04-18 07:31:51,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-04-18 07:31:51,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-04-18 07:31:51,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-04-18 07:31:51,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-04-18 07:31:51,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-04-18 07:31:51,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-04-18 07:31:51,071 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-04-18 07:31:51,071 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-04-18 07:31:51,072 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-04-18 07:31:51,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-04-18 07:31:51,073 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-FA-SemanticLbe-McrStrategy.epf [2020-04-18 07:31:51,095 INFO L113 SettingsManager]: Loading preferences was successful [2020-04-18 07:31:51,095 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-04-18 07:31:51,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-04-18 07:31:51,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-04-18 07:31:51,099 INFO L138 SettingsManager]: * Use SBE=true [2020-04-18 07:31:51,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-04-18 07:31:51,099 INFO L138 SettingsManager]: * sizeof long=4 [2020-04-18 07:31:51,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-04-18 07:31:51,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-04-18 07:31:51,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-04-18 07:31:51,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-04-18 07:31:51,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-04-18 07:31:51,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-04-18 07:31:51,102 INFO L138 SettingsManager]: * sizeof long double=12 [2020-04-18 07:31:51,102 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-04-18 07:31:51,102 INFO L138 SettingsManager]: * Use constant arrays=true [2020-04-18 07:31:51,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-04-18 07:31:51,103 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-04-18 07:31:51,103 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-04-18 07:31:51,103 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-04-18 07:31:51,103 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-04-18 07:31:51,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 07:31:51,104 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-04-18 07:31:51,104 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-04-18 07:31:51,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-04-18 07:31:51,105 INFO L138 SettingsManager]: * Trace refinement strategy=MCR [2020-04-18 07:31:51,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-04-18 07:31:51,105 INFO L138 SettingsManager]: * Trace refinement strategy used in MCR=CAMEL [2020-04-18 07:31:51,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-04-18 07:31:51,105 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-04-18 07:31:51,392 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-04-18 07:31:51,404 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-04-18 07:31:51,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-04-18 07:31:51,410 INFO L271 PluginConnector]: Initializing CDTParser... [2020-04-18 07:31:51,410 INFO L275 PluginConnector]: CDTParser initialized [2020-04-18 07:31:51,411 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longer.i [2020-04-18 07:31:51,505 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19a360eb/bb6a19ba92c540c3a65f1ebcd0c32eff/FLAG43ec7e059 [2020-04-18 07:31:52,109 INFO L306 CDTParser]: Found 1 translation units. [2020-04-18 07:31:52,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longer.i [2020-04-18 07:31:52,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19a360eb/bb6a19ba92c540c3a65f1ebcd0c32eff/FLAG43ec7e059 [2020-04-18 07:31:52,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b19a360eb/bb6a19ba92c540c3a65f1ebcd0c32eff [2020-04-18 07:31:52,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-04-18 07:31:52,404 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-04-18 07:31:52,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-04-18 07:31:52,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-04-18 07:31:52,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-04-18 07:31:52,412 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 07:31:52" (1/1) ... [2020-04-18 07:31:52,414 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710ba30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:52, skipping insertion in model container [2020-04-18 07:31:52,415 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.04 07:31:52" (1/1) ... [2020-04-18 07:31:52,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-04-18 07:31:52,496 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-04-18 07:31:53,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 07:31:53,249 INFO L203 MainTranslator]: Completed pre-run [2020-04-18 07:31:53,319 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-04-18 07:31:53,476 INFO L208 MainTranslator]: Completed translation [2020-04-18 07:31:53,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53 WrapperNode [2020-04-18 07:31:53,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-04-18 07:31:53,479 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-04-18 07:31:53,479 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-04-18 07:31:53,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-04-18 07:31:53,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-04-18 07:31:53,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-04-18 07:31:53,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-04-18 07:31:53,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-04-18 07:31:53,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,593 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... [2020-04-18 07:31:53,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-04-18 07:31:53,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-04-18 07:31:53,624 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-04-18 07:31:53,624 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-04-18 07:31:53,627 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-04-18 07:31:53,710 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2020-04-18 07:31:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2020-04-18 07:31:53,711 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2020-04-18 07:31:53,711 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2020-04-18 07:31:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-04-18 07:31:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-04-18 07:31:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-04-18 07:31:53,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-04-18 07:31:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2020-04-18 07:31:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-04-18 07:31:53,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-04-18 07:31:53,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-04-18 07:31:53,715 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-04-18 07:31:54,458 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-04-18 07:31:54,459 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-04-18 07:31:54,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 07:31:54 BoogieIcfgContainer [2020-04-18 07:31:54,464 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-04-18 07:31:54,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-04-18 07:31:54,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-04-18 07:31:54,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-04-18 07:31:54,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.04 07:31:52" (1/3) ... [2020-04-18 07:31:54,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe7cde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 07:31:54, skipping insertion in model container [2020-04-18 07:31:54,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.04 07:31:53" (2/3) ... [2020-04-18 07:31:54,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe7cde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.04 07:31:54, skipping insertion in model container [2020-04-18 07:31:54,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.04 07:31:54" (3/3) ... [2020-04-18 07:31:54,480 INFO L109 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2020-04-18 07:31:54,491 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-04-18 07:31:54,492 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-04-18 07:31:54,499 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-04-18 07:31:54,500 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-04-18 07:31:54,545 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,546 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,547 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,547 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,548 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,548 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,548 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,548 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,549 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,549 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,549 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,549 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,549 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,550 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,550 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,551 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,551 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,551 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,551 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,551 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,551 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,552 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,552 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,552 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,552 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,552 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,552 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,553 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,553 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,553 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,553 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,553 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,554 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,554 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,554 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,554 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,554 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,555 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,555 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,555 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,555 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,555 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,556 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,556 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,556 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,556 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,556 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,557 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,557 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,557 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,557 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,558 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,558 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,558 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,558 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,558 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,559 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,559 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,559 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,559 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,560 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,560 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,560 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,560 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,560 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,561 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,561 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,561 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,561 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,561 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,562 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,562 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,562 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,562 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,562 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,563 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,563 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,563 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,563 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,563 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,564 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,564 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,564 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,564 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,564 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,565 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,566 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,566 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,567 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,567 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,567 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,567 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,568 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,568 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,568 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,568 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,569 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,569 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,569 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,569 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,569 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,570 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,570 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,570 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,570 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,570 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,571 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,571 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,571 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,571 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,571 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,572 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,572 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,572 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,572 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,572 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,573 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,573 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,573 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,573 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,573 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,574 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,574 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,574 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,574 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,574 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,575 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,576 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,577 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,577 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,577 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,577 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,578 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,578 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,578 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,578 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,578 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,578 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,579 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,579 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,580 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,580 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,580 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,580 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,580 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,581 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,581 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,581 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,581 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,581 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,581 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,582 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,582 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,582 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,582 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,582 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,583 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,583 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,583 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,583 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,583 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,583 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,584 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,584 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,584 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,584 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,584 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,585 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,585 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,585 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,585 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,586 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,586 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,586 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,586 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,586 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,586 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,587 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,587 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,587 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,587 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,587 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,588 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,588 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,588 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,588 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,588 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,588 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,589 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,589 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,589 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,589 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,590 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,590 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,590 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,590 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,590 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,591 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,591 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,591 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,591 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,595 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,595 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,595 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,596 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,596 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,596 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,596 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,596 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,597 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,597 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,597 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,597 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,597 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~value~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,598 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,598 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,598 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_enqueue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,598 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,598 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,598 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,599 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,599 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,599 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,599 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,605 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,606 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,606 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,606 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,606 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,607 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,607 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,607 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,607 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,607 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,608 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_empty_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,608 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,608 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,608 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,608 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,608 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,609 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,609 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,609 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,609 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,609 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~q.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,610 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,610 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,610 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,610 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,610 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,611 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,611 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,611 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,611 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_dequeue_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,611 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-04-18 07:31:54,639 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-04-18 07:31:54,660 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-04-18 07:31:54,660 INFO L376 AbstractCegarLoop]: Hoare is true [2020-04-18 07:31:54,660 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-04-18 07:31:54,660 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-04-18 07:31:54,660 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-04-18 07:31:54,660 INFO L380 AbstractCegarLoop]: Difference is false [2020-04-18 07:31:54,661 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-04-18 07:31:54,661 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-04-18 07:31:54,687 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 204 transitions, 430 flow [2020-04-18 07:31:54,689 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions, 430 flow [2020-04-18 07:31:54,842 INFO L129 PetriNetUnfolder]: 14/204 cut-off events. [2020-04-18 07:31:54,843 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 07:31:54,857 INFO L80 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2020-04-18 07:31:54,867 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 196 places, 204 transitions, 430 flow [2020-04-18 07:31:54,916 INFO L129 PetriNetUnfolder]: 14/204 cut-off events. [2020-04-18 07:31:54,916 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2020-04-18 07:31:54,921 INFO L80 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 204 events. 14/204 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 0/189 useless extension candidates. Maximal degree in co-relation 139. Up to 3 conditions per place. [2020-04-18 07:31:54,931 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 9440 [2020-04-18 07:31:54,932 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-04-18 07:31:58,327 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2020-04-18 07:31:59,153 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-04-18 07:31:59,295 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-04-18 07:32:00,085 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 122 [2020-04-18 07:32:00,519 WARN L192 SmtUtils]: Spent 431.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2020-04-18 07:32:03,049 WARN L192 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 155 DAG size of output: 147 [2020-04-18 07:32:03,863 WARN L192 SmtUtils]: Spent 811.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2020-04-18 07:32:03,884 INFO L206 etLargeBlockEncoding]: Checked pairs total: 17748 [2020-04-18 07:32:03,885 INFO L214 etLargeBlockEncoding]: Total number of compositions: 178 [2020-04-18 07:32:03,888 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 55 transitions, 132 flow [2020-04-18 07:32:03,925 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 716 states. [2020-04-18 07:32:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states. [2020-04-18 07:32:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 07:32:03,934 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:03,934 INFO L425 BasicCegarLoop]: trace histogram [1] [2020-04-18 07:32:03,935 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:03,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:03,941 INFO L82 PathProgramCache]: Analyzing trace with hash 810, now seen corresponding path program 1 times [2020-04-18 07:32:03,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:03,949 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1055615741] [2020-04-18 07:32:03,965 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:03,972 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 07:32:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states. [2020-04-18 07:32:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-04-18 07:32:03,974 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:03,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:03,975 INFO L82 PathProgramCache]: Analyzing trace with hash 810, now seen corresponding path program 2 times [2020-04-18 07:32:03,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:03,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080777680] [2020-04-18 07:32:03,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:04,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:04,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080777680] [2020-04-18 07:32:04,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:04,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-04-18 07:32:04,096 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:04,096 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,096 INFO L259 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-04-18 07:32:04,096 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:04,099 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:04,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 07:32:04,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 07:32:04,106 INFO L87 Difference]: Start difference. First operand 2 states. Second operand 2 states. [2020-04-18 07:32:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,112 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2020-04-18 07:32:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2 states and 1 transitions. [2020-04-18 07:32:04,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:04,113 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1055615741] [2020-04-18 07:32:04,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:04,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [0] total 0 [2020-04-18 07:32:04,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1055615741] [2020-04-18 07:32:04,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-04-18 07:32:04,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:04,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-04-18 07:32:04,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 07:32:04,121 INFO L87 Difference]: Start difference. First operand 716 states. Second operand 2 states. [2020-04-18 07:32:04,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,158 INFO L93 Difference]: Finished difference Result 715 states and 1901 transitions. [2020-04-18 07:32:04,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-04-18 07:32:04,160 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-04-18 07:32:04,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:04,193 INFO L225 Difference]: With dead ends: 715 [2020-04-18 07:32:04,194 INFO L226 Difference]: Without dead ends: 524 [2020-04-18 07:32:04,197 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-04-18 07:32:04,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2020-04-18 07:32:04,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2020-04-18 07:32:04,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-04-18 07:32:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1400 transitions. [2020-04-18 07:32:04,300 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1400 transitions. Word has length 1 [2020-04-18 07:32:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:04,300 INFO L479 AbstractCegarLoop]: Abstraction has 524 states and 1400 transitions. [2020-04-18 07:32:04,300 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-04-18 07:32:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1400 transitions. [2020-04-18 07:32:04,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:32:04,304 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:04,305 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:04,305 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:04,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1385599744, now seen corresponding path program 1 times [2020-04-18 07:32:04,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:04,306 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1927827141] [2020-04-18 07:32:04,307 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,308 INFO L259 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-04-18 07:32:04,308 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-04-18 07:32:04,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-04-18 07:32:04,309 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:04,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:04,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1385599744, now seen corresponding path program 2 times [2020-04-18 07:32:04,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:04,310 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863411226] [2020-04-18 07:32:04,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:04,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863411226] [2020-04-18 07:32:04,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:04,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-04-18 07:32:04,502 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:04,505 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,511 INFO L259 McrAutomatonBuilder]: Finished intersection with 16 states and 15 transitions. [2020-04-18 07:32:04,512 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:04,532 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:04,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:04,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,533 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2020-04-18 07:32:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,534 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-04-18 07:32:04,534 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-04-18 07:32:04,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:04,535 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1927827141] [2020-04-18 07:32:04,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:04,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2020-04-18 07:32:04,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1927827141] [2020-04-18 07:32:04,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:32:04,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:04,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:04,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,537 INFO L87 Difference]: Start difference. First operand 524 states and 1400 transitions. Second operand 3 states. [2020-04-18 07:32:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,556 INFO L93 Difference]: Finished difference Result 236 states and 509 transitions. [2020-04-18 07:32:04,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:32:04,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-04-18 07:32:04,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:04,559 INFO L225 Difference]: With dead ends: 236 [2020-04-18 07:32:04,559 INFO L226 Difference]: Without dead ends: 212 [2020-04-18 07:32:04,561 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-04-18 07:32:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2020-04-18 07:32:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-04-18 07:32:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 464 transitions. [2020-04-18 07:32:04,576 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 464 transitions. Word has length 15 [2020-04-18 07:32:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:04,577 INFO L479 AbstractCegarLoop]: Abstraction has 212 states and 464 transitions. [2020-04-18 07:32:04,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:32:04,577 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 464 transitions. [2020-04-18 07:32:04,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:04,579 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:04,580 INFO L425 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:04,580 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:04,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:04,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1061498615, now seen corresponding path program 1 times [2020-04-18 07:32:04,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:04,581 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [402577908] [2020-04-18 07:32:04,583 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,585 INFO L259 McrAutomatonBuilder]: Finished intersection with 72 states and 123 transitions. [2020-04-18 07:32:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2020-04-18 07:32:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-04-18 07:32:04,588 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:04,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1061498615, now seen corresponding path program 2 times [2020-04-18 07:32:04,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:04,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467703743] [2020-04-18 07:32:04,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:04,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:04,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:04,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467703743] [2020-04-18 07:32:04,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:04,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:04,691 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:04,695 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,704 INFO L259 McrAutomatonBuilder]: Finished intersection with 31 states and 41 transitions. [2020-04-18 07:32:04,704 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:04,712 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:04,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:04,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,714 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 3 states. [2020-04-18 07:32:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,726 INFO L93 Difference]: Finished difference Result 72 states and 123 transitions. [2020-04-18 07:32:04,727 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 123 transitions. [2020-04-18 07:32:04,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:04,763 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [402577908] [2020-04-18 07:32:04,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:04,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:32:04,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [402577908] [2020-04-18 07:32:04,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:32:04,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:04,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:04,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,765 INFO L87 Difference]: Start difference. First operand 212 states and 464 transitions. Second operand 3 states. [2020-04-18 07:32:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,790 INFO L93 Difference]: Finished difference Result 272 states and 590 transitions. [2020-04-18 07:32:04,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:32:04,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-04-18 07:32:04,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:04,793 INFO L225 Difference]: With dead ends: 272 [2020-04-18 07:32:04,793 INFO L226 Difference]: Without dead ends: 272 [2020-04-18 07:32:04,795 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2020-04-18 07:32:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 218. [2020-04-18 07:32:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-04-18 07:32:04,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 476 transitions. [2020-04-18 07:32:04,806 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 476 transitions. Word has length 19 [2020-04-18 07:32:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:04,806 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 476 transitions. [2020-04-18 07:32:04,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:32:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 476 transitions. [2020-04-18 07:32:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 07:32:04,808 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:04,808 INFO L425 BasicCegarLoop]: 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] [2020-04-18 07:32:04,808 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:04,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1197878433, now seen corresponding path program 1 times [2020-04-18 07:32:04,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:04,816 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2090141681] [2020-04-18 07:32:04,818 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,822 INFO L259 McrAutomatonBuilder]: Finished intersection with 170 states and 312 transitions. [2020-04-18 07:32:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2020-04-18 07:32:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-04-18 07:32:04,833 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:04,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:04,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1590946145, now seen corresponding path program 2 times [2020-04-18 07:32:04,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:04,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611840419] [2020-04-18 07:32:04,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:04,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611840419] [2020-04-18 07:32:04,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:04,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:04,907 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:04,915 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,925 INFO L259 McrAutomatonBuilder]: Finished intersection with 27 states and 26 transitions. [2020-04-18 07:32:04,925 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:04,930 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:04,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:04,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,931 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2020-04-18 07:32:04,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,941 INFO L93 Difference]: Finished difference Result 170 states and 312 transitions. [2020-04-18 07:32:04,941 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 312 transitions. [2020-04-18 07:32:04,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:04,942 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2090141681] [2020-04-18 07:32:04,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:04,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2020-04-18 07:32:04,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2090141681] [2020-04-18 07:32:04,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-04-18 07:32:04,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:04,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:04,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,945 INFO L87 Difference]: Start difference. First operand 218 states and 476 transitions. Second operand 3 states. [2020-04-18 07:32:04,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:04,965 INFO L93 Difference]: Finished difference Result 166 states and 334 transitions. [2020-04-18 07:32:04,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-04-18 07:32:04,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-04-18 07:32:04,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:04,970 INFO L225 Difference]: With dead ends: 166 [2020-04-18 07:32:04,970 INFO L226 Difference]: Without dead ends: 164 [2020-04-18 07:32:04,970 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:04,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-04-18 07:32:04,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2020-04-18 07:32:04,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-04-18 07:32:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 331 transitions. [2020-04-18 07:32:04,981 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 331 transitions. Word has length 26 [2020-04-18 07:32:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:04,981 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 331 transitions. [2020-04-18 07:32:04,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-04-18 07:32:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 331 transitions. [2020-04-18 07:32:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 07:32:04,982 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:04,982 INFO L425 BasicCegarLoop]: 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] [2020-04-18 07:32:04,986 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:04,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:04,987 INFO L82 PathProgramCache]: Analyzing trace with hash -969107883, now seen corresponding path program 1 times [2020-04-18 07:32:04,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:04,987 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1082051163] [2020-04-18 07:32:04,989 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:04,993 INFO L259 McrAutomatonBuilder]: Finished intersection with 184 states and 339 transitions. [2020-04-18 07:32:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states. [2020-04-18 07:32:04,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 07:32:05,000 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -2074689771, now seen corresponding path program 2 times [2020-04-18 07:32:05,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:05,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414821545] [2020-04-18 07:32:05,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:05,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414821545] [2020-04-18 07:32:05,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:05,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:05,089 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:05,098 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:05,108 INFO L259 McrAutomatonBuilder]: Finished intersection with 28 states and 27 transitions. [2020-04-18 07:32:05,108 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:05,113 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:05,114 INFO L87 Difference]: Start difference. First operand 184 states. Second operand 3 states. [2020-04-18 07:32:05,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:05,125 INFO L93 Difference]: Finished difference Result 195 states and 349 transitions. [2020-04-18 07:32:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 349 transitions. [2020-04-18 07:32:05,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-04-18 07:32:05,127 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:05,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:05,127 INFO L82 PathProgramCache]: Analyzing trace with hash -969107883, now seen corresponding path program 3 times [2020-04-18 07:32:05,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:05,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794936216] [2020-04-18 07:32:05,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:05,176 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794936216] [2020-04-18 07:32:05,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366250536] [2020-04-18 07:32:05,177 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:05,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-04-18 07:32:05,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 07:32:05,308 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2020-04-18 07:32:05,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 07:32:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:05,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 07:32:05,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-04-18 07:32:05,334 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:05,340 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:05,349 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 41 transitions. [2020-04-18 07:32:05,349 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:05,368 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 2 times. [2020-04-18 07:32:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-04-18 07:32:05,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:32:05,369 INFO L87 Difference]: Start difference. First operand 195 states and 349 transitions. Second operand 5 states. [2020-04-18 07:32:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:05,381 INFO L93 Difference]: Finished difference Result 195 states and 349 transitions. [2020-04-18 07:32:05,382 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 349 transitions. [2020-04-18 07:32:05,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:05,382 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1082051163] [2020-04-18 07:32:05,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:05,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-04-18 07:32:05,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1082051163] [2020-04-18 07:32:05,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-04-18 07:32:05,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:05,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:32:05,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-04-18 07:32:05,384 INFO L87 Difference]: Start difference. First operand 164 states and 331 transitions. Second operand 6 states. [2020-04-18 07:32:05,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:05,445 INFO L93 Difference]: Finished difference Result 240 states and 472 transitions. [2020-04-18 07:32:05,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-04-18 07:32:05,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-04-18 07:32:05,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:05,448 INFO L225 Difference]: With dead ends: 240 [2020-04-18 07:32:05,448 INFO L226 Difference]: Without dead ends: 240 [2020-04-18 07:32:05,448 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-04-18 07:32:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 204. [2020-04-18 07:32:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-04-18 07:32:05,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 405 transitions. [2020-04-18 07:32:05,455 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 405 transitions. Word has length 27 [2020-04-18 07:32:05,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:05,456 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 405 transitions. [2020-04-18 07:32:05,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-04-18 07:32:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 405 transitions. [2020-04-18 07:32:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-04-18 07:32:05,457 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:05,457 INFO L425 BasicCegarLoop]: trace histogram [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] [2020-04-18 07:32:05,671 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:05,672 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:05,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:05,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1561383711, now seen corresponding path program 4 times [2020-04-18 07:32:05,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:05,673 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [2024358864] [2020-04-18 07:32:05,676 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:05,680 INFO L259 McrAutomatonBuilder]: Finished intersection with 282 states and 528 transitions. [2020-04-18 07:32:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states. [2020-04-18 07:32:05,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-04-18 07:32:05,683 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:05,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash 568616071, now seen corresponding path program 5 times [2020-04-18 07:32:05,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:05,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069970019] [2020-04-18 07:32:05,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-04-18 07:32:05,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069970019] [2020-04-18 07:32:05,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:05,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:05,758 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:05,766 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:05,780 INFO L259 McrAutomatonBuilder]: Finished intersection with 35 states and 34 transitions. [2020-04-18 07:32:05,781 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:05,788 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:05,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:05,789 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 3 states. [2020-04-18 07:32:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:05,805 INFO L93 Difference]: Finished difference Result 293 states and 538 transitions. [2020-04-18 07:32:05,805 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 538 transitions. [2020-04-18 07:32:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-04-18 07:32:05,806 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:05,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:05,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1561383711, now seen corresponding path program 6 times [2020-04-18 07:32:05,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:05,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597370659] [2020-04-18 07:32:05,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:05,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:05,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597370659] [2020-04-18 07:32:05,881 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121943946] [2020-04-18 07:32:05,881 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:06,098 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2020-04-18 07:32:06,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 07:32:06,101 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2020-04-18 07:32:06,103 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 07:32:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:06,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 07:32:06,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-04-18 07:32:06,120 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:06,128 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:06,146 INFO L259 McrAutomatonBuilder]: Finished intersection with 49 states and 62 transitions. [2020-04-18 07:32:06,147 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:06,175 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 3 times. [2020-04-18 07:32:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-04-18 07:32:06,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:32:06,177 INFO L87 Difference]: Start difference. First operand 293 states and 538 transitions. Second operand 6 states. [2020-04-18 07:32:06,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:06,199 INFO L93 Difference]: Finished difference Result 293 states and 538 transitions. [2020-04-18 07:32:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 538 transitions. [2020-04-18 07:32:06,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:06,201 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [2024358864] [2020-04-18 07:32:06,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:06,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-04-18 07:32:06,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [2024358864] [2020-04-18 07:32:06,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-04-18 07:32:06,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-04-18 07:32:06,202 INFO L87 Difference]: Start difference. First operand 204 states and 405 transitions. Second operand 7 states. [2020-04-18 07:32:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:06,272 INFO L93 Difference]: Finished difference Result 280 states and 546 transitions. [2020-04-18 07:32:06,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-04-18 07:32:06,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2020-04-18 07:32:06,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:06,275 INFO L225 Difference]: With dead ends: 280 [2020-04-18 07:32:06,275 INFO L226 Difference]: Without dead ends: 280 [2020-04-18 07:32:06,276 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-04-18 07:32:06,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-04-18 07:32:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2020-04-18 07:32:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2020-04-18 07:32:06,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 479 transitions. [2020-04-18 07:32:06,284 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 479 transitions. Word has length 34 [2020-04-18 07:32:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:06,284 INFO L479 AbstractCegarLoop]: Abstraction has 244 states and 479 transitions. [2020-04-18 07:32:06,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-04-18 07:32:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 479 transitions. [2020-04-18 07:32:06,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:32:06,286 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:06,286 INFO L425 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:06,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:06,495 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:06,496 INFO L82 PathProgramCache]: Analyzing trace with hash -303137003, now seen corresponding path program 7 times [2020-04-18 07:32:06,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:06,496 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1590983244] [2020-04-18 07:32:06,497 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:06,501 INFO L259 McrAutomatonBuilder]: Finished intersection with 380 states and 717 transitions. [2020-04-18 07:32:06,503 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states. [2020-04-18 07:32:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:32:06,505 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:06,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1500459, now seen corresponding path program 8 times [2020-04-18 07:32:06,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:06,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74553850] [2020-04-18 07:32:06,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:06,543 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-04-18 07:32:06,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74553850] [2020-04-18 07:32:06,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:06,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:06,544 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:06,556 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:06,575 INFO L259 McrAutomatonBuilder]: Finished intersection with 42 states and 41 transitions. [2020-04-18 07:32:06,575 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:06,580 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:06,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:06,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:06,581 INFO L87 Difference]: Start difference. First operand 380 states. Second operand 3 states. [2020-04-18 07:32:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:06,593 INFO L93 Difference]: Finished difference Result 391 states and 727 transitions. [2020-04-18 07:32:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 727 transitions. [2020-04-18 07:32:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-04-18 07:32:06,595 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:06,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:06,595 INFO L82 PathProgramCache]: Analyzing trace with hash -303137003, now seen corresponding path program 9 times [2020-04-18 07:32:06,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:06,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832311460] [2020-04-18 07:32:06,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:06,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832311460] [2020-04-18 07:32:06,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108505964] [2020-04-18 07:32:06,683 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:07,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-04-18 07:32:07,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 07:32:07,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2020-04-18 07:32:07,254 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 07:32:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:07,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 07:32:07,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-04-18 07:32:07,267 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:07,279 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:07,355 INFO L259 McrAutomatonBuilder]: Finished intersection with 63 states and 83 transitions. [2020-04-18 07:32:07,355 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:07,406 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 4 times. [2020-04-18 07:32:07,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-04-18 07:32:07,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:07,406 INFO L87 Difference]: Start difference. First operand 391 states and 727 transitions. Second operand 7 states. [2020-04-18 07:32:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:07,438 INFO L93 Difference]: Finished difference Result 391 states and 727 transitions. [2020-04-18 07:32:07,438 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 727 transitions. [2020-04-18 07:32:07,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:07,440 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1590983244] [2020-04-18 07:32:07,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:07,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-04-18 07:32:07,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1590983244] [2020-04-18 07:32:07,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-04-18 07:32:07,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-04-18 07:32:07,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-04-18 07:32:07,441 INFO L87 Difference]: Start difference. First operand 244 states and 479 transitions. Second operand 8 states. [2020-04-18 07:32:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:07,527 INFO L93 Difference]: Finished difference Result 320 states and 620 transitions. [2020-04-18 07:32:07,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-04-18 07:32:07,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2020-04-18 07:32:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:07,529 INFO L225 Difference]: With dead ends: 320 [2020-04-18 07:32:07,529 INFO L226 Difference]: Without dead ends: 320 [2020-04-18 07:32:07,530 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2020-04-18 07:32:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-04-18 07:32:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 284. [2020-04-18 07:32:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2020-04-18 07:32:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 553 transitions. [2020-04-18 07:32:07,538 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 553 transitions. Word has length 41 [2020-04-18 07:32:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:07,538 INFO L479 AbstractCegarLoop]: Abstraction has 284 states and 553 transitions. [2020-04-18 07:32:07,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-04-18 07:32:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 553 transitions. [2020-04-18 07:32:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-04-18 07:32:07,539 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:07,540 INFO L425 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:07,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:07,744 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:07,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1439404639, now seen corresponding path program 10 times [2020-04-18 07:32:07,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:07,745 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1512959421] [2020-04-18 07:32:07,746 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:07,751 INFO L259 McrAutomatonBuilder]: Finished intersection with 478 states and 906 transitions. [2020-04-18 07:32:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states. [2020-04-18 07:32:07,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-04-18 07:32:07,755 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:07,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:07,756 INFO L82 PathProgramCache]: Analyzing trace with hash -773369657, now seen corresponding path program 11 times [2020-04-18 07:32:07,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:07,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420971812] [2020-04-18 07:32:07,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-04-18 07:32:07,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420971812] [2020-04-18 07:32:07,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:07,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:07,794 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:07,810 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:07,840 INFO L259 McrAutomatonBuilder]: Finished intersection with 49 states and 48 transitions. [2020-04-18 07:32:07,841 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:07,846 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:07,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:07,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:07,847 INFO L87 Difference]: Start difference. First operand 478 states. Second operand 3 states. [2020-04-18 07:32:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:07,861 INFO L93 Difference]: Finished difference Result 489 states and 916 transitions. [2020-04-18 07:32:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 916 transitions. [2020-04-18 07:32:07,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-04-18 07:32:07,863 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:07,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1439404639, now seen corresponding path program 12 times [2020-04-18 07:32:07,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:07,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677923489] [2020-04-18 07:32:07,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:07,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677923489] [2020-04-18 07:32:07,951 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007485655] [2020-04-18 07:32:07,951 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:08,333 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-04-18 07:32:08,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 07:32:08,336 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 39 conjunts are in the unsatisfiable core [2020-04-18 07:32:08,339 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 07:32:08,401 INFO L377 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 197 treesize of output 181 [2020-04-18 07:32:08,407 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,480 INFO L619 ElimStorePlain]: treesize reduction 130, result has 13.3 percent of original size [2020-04-18 07:32:08,481 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,482 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2020-04-18 07:32:08,548 INFO L377 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 13 treesize of output 9 [2020-04-18 07:32:08,549 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,559 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:08,560 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,560 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-04-18 07:32:08,602 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:08,602 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,615 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:08,616 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,617 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2020-04-18 07:32:08,666 INFO L172 IndexEqualityManager]: detected equality via solver [2020-04-18 07:32:08,682 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:08,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 57 [2020-04-18 07:32:08,683 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,714 INFO L619 ElimStorePlain]: treesize reduction 30, result has 50.0 percent of original size [2020-04-18 07:32:08,715 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,715 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2020-04-18 07:32:08,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-04-18 07:32:08,747 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:08,748 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,759 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:08,760 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,761 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-04-18 07:32:08,768 INFO L377 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 [2020-04-18 07:32:08,768 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,770 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:08,770 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:08,771 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:1 [2020-04-18 07:32:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-04-18 07:32:08,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 07:32:08,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-04-18 07:32:08,823 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:08,839 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:08,905 INFO L259 McrAutomatonBuilder]: Finished intersection with 77 states and 104 transitions. [2020-04-18 07:32:08,906 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:09,051 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 9 times. [2020-04-18 07:32:09,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-04-18 07:32:09,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2020-04-18 07:32:09,052 INFO L87 Difference]: Start difference. First operand 489 states and 916 transitions. Second operand 13 states. [2020-04-18 07:32:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:09,945 INFO L93 Difference]: Finished difference Result 541 states and 1007 transitions. [2020-04-18 07:32:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 1007 transitions. [2020-04-18 07:32:09,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:09,946 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1512959421] [2020-04-18 07:32:09,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:09,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-04-18 07:32:09,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1512959421] [2020-04-18 07:32:09,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-04-18 07:32:09,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-04-18 07:32:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2020-04-18 07:32:09,947 INFO L87 Difference]: Start difference. First operand 284 states and 553 transitions. Second operand 14 states. [2020-04-18 07:32:11,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:11,227 INFO L93 Difference]: Finished difference Result 568 states and 1082 transitions. [2020-04-18 07:32:11,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-04-18 07:32:11,227 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2020-04-18 07:32:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:11,230 INFO L225 Difference]: With dead ends: 568 [2020-04-18 07:32:11,230 INFO L226 Difference]: Without dead ends: 568 [2020-04-18 07:32:11,231 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=466, Invalid=1256, Unknown=0, NotChecked=0, Total=1722 [2020-04-18 07:32:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2020-04-18 07:32:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 408. [2020-04-18 07:32:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2020-04-18 07:32:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 778 transitions. [2020-04-18 07:32:11,243 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 778 transitions. Word has length 48 [2020-04-18 07:32:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:11,244 INFO L479 AbstractCegarLoop]: Abstraction has 408 states and 778 transitions. [2020-04-18 07:32:11,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-04-18 07:32:11,244 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 778 transitions. [2020-04-18 07:32:11,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-04-18 07:32:11,245 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:11,246 INFO L425 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:11,456 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:11,457 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:11,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1814708501, now seen corresponding path program 1 times [2020-04-18 07:32:11,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:11,458 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1814788299] [2020-04-18 07:32:11,461 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:11,467 INFO L259 McrAutomatonBuilder]: Finished intersection with 604 states and 1149 transitions. [2020-04-18 07:32:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2020-04-18 07:32:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-04-18 07:32:11,471 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:11,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:11,472 INFO L82 PathProgramCache]: Analyzing trace with hash -362048299, now seen corresponding path program 2 times [2020-04-18 07:32:11,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:11,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325473544] [2020-04-18 07:32:11,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-04-18 07:32:11,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325473544] [2020-04-18 07:32:11,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:11,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:11,534 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:11,574 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:11,723 INFO L259 McrAutomatonBuilder]: Finished intersection with 58 states and 57 transitions. [2020-04-18 07:32:11,723 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:11,727 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:11,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:11,728 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 3 states. [2020-04-18 07:32:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:11,743 INFO L93 Difference]: Finished difference Result 615 states and 1159 transitions. [2020-04-18 07:32:11,743 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1159 transitions. [2020-04-18 07:32:11,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-04-18 07:32:11,746 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:11,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1814708501, now seen corresponding path program 3 times [2020-04-18 07:32:11,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:11,746 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681575467] [2020-04-18 07:32:11,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:11,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681575467] [2020-04-18 07:32:11,862 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630444728] [2020-04-18 07:32:11,863 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:13,115 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-04-18 07:32:13,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 07:32:13,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2020-04-18 07:32:13,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 07:32:13,154 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 342 treesize of output 354 [2020-04-18 07:32:13,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:13,242 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,593 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 30 [2020-04-18 07:32:13,595 INFO L619 ElimStorePlain]: treesize reduction 4506, result has 0.9 percent of original size [2020-04-18 07:32:13,597 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:55, output treesize:4 [2020-04-18 07:32:13,627 INFO L377 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 13 treesize of output 9 [2020-04-18 07:32:13,628 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,631 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,631 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,632 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2020-04-18 07:32:13,658 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:13,659 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,665 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,665 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,666 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2020-04-18 07:32:13,695 INFO L172 IndexEqualityManager]: detected equality via solver [2020-04-18 07:32:13,710 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,711 INFO L377 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-04-18 07:32:13,711 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,746 INFO L619 ElimStorePlain]: treesize reduction 30, result has 53.1 percent of original size [2020-04-18 07:32:13,747 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,747 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2020-04-18 07:32:13,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-04-18 07:32:13,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-04-18 07:32:13,779 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,788 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,789 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,789 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:20 [2020-04-18 07:32:13,829 INFO L377 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 31 treesize of output 15 [2020-04-18 07:32:13,830 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,834 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,835 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,835 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:14 [2020-04-18 07:32:13,855 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:13,856 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,862 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,863 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,863 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:29, output treesize:9 [2020-04-18 07:32:13,900 INFO L172 IndexEqualityManager]: detected equality via solver [2020-04-18 07:32:13,923 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 83 [2020-04-18 07:32:13,925 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,943 INFO L619 ElimStorePlain]: treesize reduction 61, result has 26.5 percent of original size [2020-04-18 07:32:13,943 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,944 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:13 [2020-04-18 07:32:13,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-04-18 07:32:13,967 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:13,968 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,976 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,976 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2020-04-18 07:32:13,982 INFO L377 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 19 treesize of output 7 [2020-04-18 07:32:13,983 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,984 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:13,984 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:13,984 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:1 [2020-04-18 07:32:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 37 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-04-18 07:32:13,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 07:32:13,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2020-04-18 07:32:13,992 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:14,012 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:14,415 INFO L259 McrAutomatonBuilder]: Finished intersection with 95 states and 131 transitions. [2020-04-18 07:32:14,415 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:14,639 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 15 times. [2020-04-18 07:32:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-04-18 07:32:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-04-18 07:32:14,640 INFO L87 Difference]: Start difference. First operand 615 states and 1159 transitions. Second operand 18 states. [2020-04-18 07:32:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:18,157 INFO L93 Difference]: Finished difference Result 988 states and 1859 transitions. [2020-04-18 07:32:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1859 transitions. [2020-04-18 07:32:18,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:18,161 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1814788299] [2020-04-18 07:32:18,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:18,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-04-18 07:32:18,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1814788299] [2020-04-18 07:32:18,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-04-18 07:32:18,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 07:32:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=1263, Unknown=0, NotChecked=0, Total=1640 [2020-04-18 07:32:18,163 INFO L87 Difference]: Start difference. First operand 408 states and 778 transitions. Second operand 19 states. [2020-04-18 07:32:20,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:20,511 INFO L93 Difference]: Finished difference Result 868 states and 1635 transitions. [2020-04-18 07:32:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2020-04-18 07:32:20,512 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 57 [2020-04-18 07:32:20,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:20,517 INFO L225 Difference]: With dead ends: 868 [2020-04-18 07:32:20,518 INFO L226 Difference]: Without dead ends: 868 [2020-04-18 07:32:20,520 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1233, Invalid=5247, Unknown=0, NotChecked=0, Total=6480 [2020-04-18 07:32:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2020-04-18 07:32:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 612. [2020-04-18 07:32:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2020-04-18 07:32:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 1143 transitions. [2020-04-18 07:32:20,537 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 1143 transitions. Word has length 57 [2020-04-18 07:32:20,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:20,537 INFO L479 AbstractCegarLoop]: Abstraction has 612 states and 1143 transitions. [2020-04-18 07:32:20,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-04-18 07:32:20,537 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 1143 transitions. [2020-04-18 07:32:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-04-18 07:32:20,539 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:20,539 INFO L425 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:20,744 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:20,745 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:20,745 INFO L82 PathProgramCache]: Analyzing trace with hash -596968485, now seen corresponding path program 4 times [2020-04-18 07:32:20,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:20,746 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1110163172] [2020-04-18 07:32:20,749 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:20,757 INFO L259 McrAutomatonBuilder]: Finished intersection with 716 states and 1365 transitions. [2020-04-18 07:32:20,761 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states. [2020-04-18 07:32:20,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-04-18 07:32:20,764 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:20,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:20,764 INFO L82 PathProgramCache]: Analyzing trace with hash 997532327, now seen corresponding path program 5 times [2020-04-18 07:32:20,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:20,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94083701] [2020-04-18 07:32:20,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-04-18 07:32:20,829 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94083701] [2020-04-18 07:32:20,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:20,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:20,830 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:20,856 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:21,053 INFO L259 McrAutomatonBuilder]: Finished intersection with 116 states and 165 transitions. [2020-04-18 07:32:21,054 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:21,062 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:21,063 INFO L87 Difference]: Start difference. First operand 716 states. Second operand 3 states. [2020-04-18 07:32:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:21,075 INFO L93 Difference]: Finished difference Result 727 states and 1375 transitions. [2020-04-18 07:32:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1375 transitions. [2020-04-18 07:32:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-04-18 07:32:21,077 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash -247911873, now seen corresponding path program 6 times [2020-04-18 07:32:21,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:21,078 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420057899] [2020-04-18 07:32:21,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:21,220 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:21,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420057899] [2020-04-18 07:32:21,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391651660] [2020-04-18 07:32:21,221 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:22,727 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2020-04-18 07:32:22,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 07:32:22,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 54 conjunts are in the unsatisfiable core [2020-04-18 07:32:22,734 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 07:32:22,744 INFO L377 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 47 treesize of output 45 [2020-04-18 07:32:22,745 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-04-18 07:32:22,776 INFO L619 ElimStorePlain]: treesize reduction 26, result has 43.5 percent of original size [2020-04-18 07:32:22,777 INFO L539 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,777 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:8 [2020-04-18 07:32:22,818 INFO L377 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 13 treesize of output 9 [2020-04-18 07:32:22,818 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,824 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:22,825 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-04-18 07:32:22,845 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:22,845 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,853 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:22,854 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,854 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:17 [2020-04-18 07:32:22,886 INFO L172 IndexEqualityManager]: detected equality via solver [2020-04-18 07:32:22,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:22,901 INFO L377 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 57 [2020-04-18 07:32:22,901 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,937 INFO L619 ElimStorePlain]: treesize reduction 30, result has 55.2 percent of original size [2020-04-18 07:32:22,938 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:23 [2020-04-18 07:32:22,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-04-18 07:32:22,969 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2020-04-18 07:32:22,970 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,982 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:22,983 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:22,983 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:23 [2020-04-18 07:32:23,013 INFO L377 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 31 treesize of output 15 [2020-04-18 07:32:23,013 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,020 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:23,020 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,020 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:17 [2020-04-18 07:32:23,050 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:23,051 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,058 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:23,059 INFO L539 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,059 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:13 [2020-04-18 07:32:23,098 INFO L172 IndexEqualityManager]: detected equality via solver [2020-04-18 07:32:23,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:23,112 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 57 [2020-04-18 07:32:23,113 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,140 INFO L619 ElimStorePlain]: treesize reduction 30, result has 50.0 percent of original size [2020-04-18 07:32:23,141 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:16 [2020-04-18 07:32:23,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-04-18 07:32:23,163 INFO L377 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 25 treesize of output 24 [2020-04-18 07:32:23,164 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,188 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:23,189 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2020-04-18 07:32:23,193 INFO L377 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 [2020-04-18 07:32:23,194 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,195 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:23,195 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-04-18 07:32:23,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:1 [2020-04-18 07:32:23,210 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-04-18 07:32:23,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-04-18 07:32:23,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2020-04-18 07:32:23,211 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:23,244 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:23,658 INFO L259 McrAutomatonBuilder]: Finished intersection with 111 states and 155 transitions. [2020-04-18 07:32:23,658 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:23,909 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 5 times. [2020-04-18 07:32:23,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-04-18 07:32:23,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-04-18 07:32:23,910 INFO L87 Difference]: Start difference. First operand 727 states and 1375 transitions. Second operand 19 states. [2020-04-18 07:32:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:28,343 INFO L93 Difference]: Finished difference Result 1247 states and 2357 transitions. [2020-04-18 07:32:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 2357 transitions. [2020-04-18 07:32:28,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-04-18 07:32:28,346 INFO L354 FreeRefinementEngine]: Using interpolant generator StrategyModuleMcr [1110163172] [2020-04-18 07:32:28,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-04-18 07:32:28,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-04-18 07:32:28,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder StrategyModuleMcr [1110163172] [2020-04-18 07:32:28,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-04-18 07:32:28,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy MCR [2020-04-18 07:32:28,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-04-18 07:32:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=1435, Unknown=0, NotChecked=0, Total=1892 [2020-04-18 07:32:28,348 INFO L87 Difference]: Start difference. First operand 612 states and 1143 transitions. Second operand 20 states. [2020-04-18 07:32:31,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:31,059 INFO L93 Difference]: Finished difference Result 968 states and 1814 transitions. [2020-04-18 07:32:31,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-04-18 07:32:31,060 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2020-04-18 07:32:31,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-04-18 07:32:31,066 INFO L225 Difference]: With dead ends: 968 [2020-04-18 07:32:31,066 INFO L226 Difference]: Without dead ends: 968 [2020-04-18 07:32:31,069 INFO L678 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2674 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1570, Invalid=6440, Unknown=0, NotChecked=0, Total=8010 [2020-04-18 07:32:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2020-04-18 07:32:31,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 704. [2020-04-18 07:32:31,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-04-18 07:32:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1308 transitions. [2020-04-18 07:32:31,087 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1308 transitions. Word has length 65 [2020-04-18 07:32:31,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-04-18 07:32:31,087 INFO L479 AbstractCegarLoop]: Abstraction has 704 states and 1308 transitions. [2020-04-18 07:32:31,087 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-04-18 07:32:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1308 transitions. [2020-04-18 07:32:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-04-18 07:32:31,089 INFO L417 BasicCegarLoop]: Found error trace [2020-04-18 07:32:31,089 INFO L425 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-04-18 07:32:31,295 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:31,295 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-04-18 07:32:31,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:31,295 INFO L82 PathProgramCache]: Analyzing trace with hash 68322069, now seen corresponding path program 7 times [2020-04-18 07:32:31,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy MCR [2020-04-18 07:32:31,296 INFO L354 FreeRefinementEngine]: Using trace check StrategyModuleMcr [1918569130] [2020-04-18 07:32:31,300 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:31,310 INFO L259 McrAutomatonBuilder]: Finished intersection with 828 states and 1581 transitions. [2020-04-18 07:32:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states. [2020-04-18 07:32:31,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-04-18 07:32:31,316 INFO L105 Mcr]: ---- MCR iteration 0 ---- [2020-04-18 07:32:31,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:31,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1352240853, now seen corresponding path program 8 times [2020-04-18 07:32:31,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:31,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032145866] [2020-04-18 07:32:31,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2020-04-18 07:32:31,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032145866] [2020-04-18 07:32:31,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-04-18 07:32:31,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-04-18 07:32:31,383 INFO L201 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-04-18 07:32:31,416 INFO L256 McrAutomatonBuilder]: Started intersection. [2020-04-18 07:32:31,575 INFO L259 McrAutomatonBuilder]: Finished intersection with 74 states and 73 transitions. [2020-04-18 07:32:31,575 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton. [2020-04-18 07:32:31,586 INFO L356 McrAutomatonBuilder]: Construction finished. Needed to calculate wp 0 times. [2020-04-18 07:32:31,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-04-18 07:32:31,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-04-18 07:32:31,587 INFO L87 Difference]: Start difference. First operand 828 states. Second operand 3 states. [2020-04-18 07:32:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-04-18 07:32:31,597 INFO L93 Difference]: Finished difference Result 839 states and 1591 transitions. [2020-04-18 07:32:31,598 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1591 transitions. [2020-04-18 07:32:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-04-18 07:32:31,599 INFO L105 Mcr]: ---- MCR iteration 1 ---- [2020-04-18 07:32:31,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-04-18 07:32:31,599 INFO L82 PathProgramCache]: Analyzing trace with hash 68322069, now seen corresponding path program 9 times [2020-04-18 07:32:31,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-04-18 07:32:31,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157493288] [2020-04-18 07:32:31,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-04-18 07:32:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-04-18 07:32:31,709 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-04-18 07:32:31,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157493288] [2020-04-18 07:32:31,710 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185539242] [2020-04-18 07:32:31,710 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:35,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2020-04-18 07:32:35,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-04-18 07:32:35,389 INFO L264 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 43 conjunts are in the unsatisfiable core [2020-04-18 07:32:35,391 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-04-18 07:32:35,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-04-18 07:32:35,443 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 484 treesize of output 508 [2020-04-18 07:32:35,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2020-04-18 07:32:35,939 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-04-18 07:32:37,122 WARN L192 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 338 DAG size of output: 67 [2020-04-18 07:32:37,123 INFO L619 ElimStorePlain]: treesize reduction 46043, result has 0.3 percent of original size [2020-04-18 07:32:37,130 INFO L172 IndexEqualityManager]: detected equality via solver [2020-04-18 07:32:37,131 WARN L341 FreeRefinementEngine]: Global settings require throwing the following exception [2020-04-18 07:32:37,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-04-18 07:32:37,333 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: need array sort at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.arrayEquality(SmtUtils.java:741) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.binaryEquality(SmtUtils.java:644) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.checkEqualityStatusViaSolver(ArrayIndexEqualityManager.java:149) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.checkEqualityStatus(ArrayIndexEqualityManager.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.analyzeIndexEqualities(Elim1Store.java:609) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:233) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:403) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:289) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:596) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:509) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:186) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.StrategyModuleMcr.getResult(StrategyModuleMcr.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.Mcr.exploreInterleavings(Mcr.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.Mcr.(Mcr.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.StrategyModuleMcr.getOrConstruct(StrategyModuleMcr.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.StrategyModuleMcr.isCorrect(StrategyModuleMcr.java:64) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-04-18 07:32:37,337 INFO L168 Benchmark]: Toolchain (without parser) took 44949.94 ms. Allocated memory was 145.8 MB in the beginning and 865.6 MB in the end (delta: 719.8 MB). Free memory was 100.4 MB in the beginning and 624.4 MB in the end (delta: -524.0 MB). Peak memory consumption was 622.5 MB. Max. memory is 7.1 GB. [2020-04-18 07:32:37,338 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-04-18 07:32:37,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1073.59 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 132.2 MB in the end (delta: -33.7 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. [2020-04-18 07:32:37,339 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.38 ms. Allocated memory is still 202.9 MB. Free memory was 132.2 MB in the beginning and 129.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-04-18 07:32:37,339 INFO L168 Benchmark]: Boogie Preprocessor took 47.94 ms. Allocated memory is still 202.9 MB. Free memory was 129.5 MB in the beginning and 126.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-04-18 07:32:37,339 INFO L168 Benchmark]: RCFGBuilder took 840.73 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 126.9 MB in the beginning and 200.3 MB in the end (delta: -73.4 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. [2020-04-18 07:32:37,340 INFO L168 Benchmark]: TraceAbstraction took 42870.56 ms. Allocated memory was 234.9 MB in the beginning and 865.6 MB in the end (delta: 630.7 MB). Free memory was 200.3 MB in the beginning and 624.4 MB in the end (delta: -424.1 MB). Peak memory consumption was 633.3 MB. Max. memory is 7.1 GB. [2020-04-18 07:32:37,342 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1073.59 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 98.5 MB in the beginning and 132.2 MB in the end (delta: -33.7 MB). Peak memory consumption was 31.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 96.38 ms. Allocated memory is still 202.9 MB. Free memory was 132.2 MB in the beginning and 129.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.94 ms. Allocated memory is still 202.9 MB. Free memory was 129.5 MB in the beginning and 126.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.73 ms. Allocated memory was 202.9 MB in the beginning and 234.9 MB in the end (delta: 32.0 MB). Free memory was 126.9 MB in the beginning and 200.3 MB in the end (delta: -73.4 MB). Peak memory consumption was 42.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42870.56 ms. Allocated memory was 234.9 MB in the beginning and 865.6 MB in the end (delta: 630.7 MB). Free memory was 200.3 MB in the beginning and 624.4 MB in the end (delta: -424.1 MB). Peak memory consumption was 633.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.1s, 196 ProgramPointsBefore, 53 ProgramPointsAfterwards, 204 TransitionsBefore, 55 TransitionsAfterwards, 9440 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 92 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 19 ConcurrentYvCompositions, 6 ChoiceCompositions, 4960 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 17 SemBasedMoverChecksPositive, 115 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 17748 CheckedPairsTotal, 178 TotalNumberOfCompositions - ExceptionOrErrorResult: UnsupportedOperationException: need array sort de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: need array sort: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.arrayEquality(SmtUtils.java:741) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...