/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:51:11,075 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:51:11,077 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:51:11,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:51:11,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:51:11,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:51:11,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:51:11,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:51:11,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:51:11,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:51:11,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:51:11,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:51:11,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:51:11,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:51:11,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:51:11,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:51:11,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:51:11,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:51:11,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:51:11,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:51:11,124 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:51:11,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:51:11,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:51:11,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:51:11,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:51:11,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:51:11,134 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:51:11,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:51:11,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:51:11,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:51:11,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:51:11,143 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:51:11,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:51:11,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:51:11,147 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:51:11,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:51:11,148 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:51:11,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:51:11,149 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:51:11,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:51:11,151 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:51:11,153 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:51:11,200 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:51:11,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:51:11,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:51:11,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:51:11,202 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:51:11,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:51:11,203 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:51:11,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:51:11,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:51:11,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:51:11,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:51:11,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:51:11,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:51:11,206 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:51:11,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:51:11,206 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:51:11,206 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:51:11,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:51:11,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:51:11,207 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:51:11,207 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:51:11,207 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:51:11,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:51:11,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:51:11,208 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:51:11,208 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:51:11,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:51:11,209 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:51:11,209 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:51:11,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:51:11,209 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:51:11,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:51:11,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:51:11,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:51:11,559 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:51:11,559 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:51:11,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-10-22 00:51:11,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fad2630b/4574c09295d14f43903e4818d0165e94/FLAG3316a76db [2020-10-22 00:51:12,217 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:51:12,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2020-10-22 00:51:12,236 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fad2630b/4574c09295d14f43903e4818d0165e94/FLAG3316a76db [2020-10-22 00:51:12,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fad2630b/4574c09295d14f43903e4818d0165e94 [2020-10-22 00:51:12,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:51:12,478 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:51:12,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:51:12,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:51:12,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:51:12,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:51:12" (1/1) ... [2020-10-22 00:51:12,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7806413c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:12, skipping insertion in model container [2020-10-22 00:51:12,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:51:12" (1/1) ... [2020-10-22 00:51:12,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:51:12,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:51:12,762 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-22 00:51:13,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:51:13,202 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:51:13,217 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2020-10-22 00:51:13,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:51:13,458 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:51:13,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13 WrapperNode [2020-10-22 00:51:13,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:51:13,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:51:13,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:51:13,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:51:13,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:51:13,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:51:13,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:51:13,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:51:13,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,595 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,641 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,650 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (1/1) ... [2020-10-22 00:51:13,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:51:13,662 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:51:13,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:51:13,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:51:13,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (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-10-22 00:51:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2020-10-22 00:51:13,751 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2020-10-22 00:51:13,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:51:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-22 00:51:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:51:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-22 00:51:13,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:51:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-22 00:51:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-22 00:51:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:51:13,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:51:13,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:51:13,756 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:51:14,715 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:51:14,716 INFO L298 CfgBuilder]: Removed 62 assume(true) statements. [2020-10-22 00:51:14,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:51:14 BoogieIcfgContainer [2020-10-22 00:51:14,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:51:14,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:51:14,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:51:14,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:51:14,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:51:12" (1/3) ... [2020-10-22 00:51:14,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5ae79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:51:14, skipping insertion in model container [2020-10-22 00:51:14,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:51:13" (2/3) ... [2020-10-22 00:51:14,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f5ae79d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:51:14, skipping insertion in model container [2020-10-22 00:51:14,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:51:14" (3/3) ... [2020-10-22 00:51:14,726 INFO L111 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2020-10-22 00:51:14,738 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:51:14,738 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:51:14,746 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2020-10-22 00:51:14,747 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:51:14,791 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,792 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,792 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,792 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,793 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,794 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,794 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,794 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,794 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,794 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,795 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,795 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,795 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,795 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,795 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,795 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,796 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,796 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,796 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,796 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,796 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,796 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,797 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,798 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,798 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,799 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,800 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,800 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,800 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,800 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,800 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,801 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,801 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,801 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,801 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,801 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,802 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,802 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,802 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,803 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,803 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,803 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,803 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,803 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,804 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,804 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,804 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,804 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,804 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,805 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,805 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,805 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,805 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,805 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,806 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,806 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,806 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,806 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,806 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,807 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,807 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,807 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,807 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,807 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,808 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,808 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,808 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,808 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,808 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,809 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,809 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,809 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,809 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,809 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,809 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,810 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,810 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,810 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,810 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,811 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,811 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,811 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,811 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,811 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,812 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,812 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,812 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,812 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,812 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,813 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,813 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,813 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,813 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,813 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,813 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,814 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,814 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,814 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,814 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,814 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,815 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,815 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,815 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,815 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,815 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,816 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,816 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,816 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,816 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,816 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,816 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,817 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,817 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,817 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,817 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,817 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,818 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,818 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,818 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,818 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,818 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,818 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,819 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,819 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,819 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,819 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,819 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,820 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,820 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,820 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,820 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,820 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,821 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,821 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,821 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,821 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,821 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,821 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,822 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,822 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,822 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,822 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,822 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,822 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,823 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,823 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,823 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,823 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,823 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,824 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,824 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,824 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,824 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,824 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,825 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,825 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,825 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,825 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,825 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,825 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,826 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,826 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,826 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,826 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,826 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,827 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,827 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,827 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,827 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,834 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,835 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,835 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,835 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,835 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,836 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,836 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,836 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,836 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,836 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,836 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,837 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,837 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,837 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,837 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,837 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,838 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,838 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre30.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,838 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,838 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,838 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,838 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,839 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,839 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,839 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,839 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,839 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,840 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,840 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,840 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,840 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,840 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,841 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,841 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,841 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,841 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,841 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,842 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,842 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem31.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,842 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,842 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,842 WARN L313 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,842 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,843 WARN L313 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:51:14,854 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2020-10-22 00:51:14,870 INFO L253 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-10-22 00:51:14,894 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:51:14,894 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:51:14,894 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:51:14,895 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:51:14,895 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:51:14,895 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:51:14,895 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:51:14,895 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:51:14,923 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:51:14,924 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 459 places, 498 transitions, 1004 flow [2020-10-22 00:51:14,927 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 459 places, 498 transitions, 1004 flow [2020-10-22 00:51:14,929 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 459 places, 498 transitions, 1004 flow [2020-10-22 00:51:15,156 INFO L129 PetriNetUnfolder]: 43/497 cut-off events. [2020-10-22 00:51:15,157 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2020-10-22 00:51:15,170 INFO L80 FinitePrefix]: Finished finitePrefix Result has 502 conditions, 497 events. 43/497 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1245 event pairs, 0 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 348. Up to 3 conditions per place. [2020-10-22 00:51:15,200 INFO L116 LiptonReduction]: Number of co-enabled transitions 34102 [2020-10-22 00:51:17,049 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:17,061 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:51:17,063 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:17,063 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2020-10-22 00:51:17,265 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:17,276 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:51:17,278 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:17,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2020-10-22 00:51:21,426 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:21,460 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:51:21,463 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:21,463 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:106, output treesize:92 [2020-10-22 00:51:22,556 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-10-22 00:51:22,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:51:23,126 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2020-10-22 00:51:23,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-22 00:51:23,889 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-22 00:51:24,161 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-22 00:51:24,438 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-10-22 00:51:24,716 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-10-22 00:51:25,598 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification that was a NOOP. DAG size: 152 [2020-10-22 00:51:25,912 WARN L193 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2020-10-22 00:51:26,433 WARN L193 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 109 [2020-10-22 00:51:26,455 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:26,588 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-22 00:51:26,589 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:51:26,590 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:26,591 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:382, output treesize:388 [2020-10-22 00:51:26,709 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-22 00:51:27,076 WARN L193 SmtUtils]: Spent 366.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2020-10-22 00:51:27,334 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-10-22 00:51:27,511 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2020-10-22 00:51:31,441 WARN L193 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 229 DAG size of output: 214 [2020-10-22 00:51:31,471 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:33,203 WARN L193 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 199 [2020-10-22 00:51:33,204 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:51:33,205 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-22 00:51:33,206 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:593, output treesize:638 [2020-10-22 00:51:34,815 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 199 [2020-10-22 00:51:34,843 INFO L131 LiptonReduction]: Checked pairs total: 79858 [2020-10-22 00:51:34,843 INFO L133 LiptonReduction]: Total number of compositions: 539 [2020-10-22 00:51:34,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 109 places, 126 transitions, 260 flow [2020-10-22 00:51:34,911 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1509 states. [2020-10-22 00:51:34,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states. [2020-10-22 00:51:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2020-10-22 00:51:34,922 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:34,923 INFO L422 BasicCegarLoop]: trace histogram [1] [2020-10-22 00:51:34,924 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1816, now seen corresponding path program 1 times [2020-10-22 00:51:34,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:34,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884696386] [2020-10-22 00:51:34,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:35,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884696386] [2020-10-22 00:51:35,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:35,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2020-10-22 00:51:35,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459539005] [2020-10-22 00:51:35,066 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:35,069 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:35,077 INFO L252 McrAutomatonBuilder]: Finished intersection with 2 states and 1 transitions. [2020-10-22 00:51:35,077 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:35,081 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:51:35,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-22 00:51:35,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-22 00:51:35,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-22 00:51:35,100 INFO L87 Difference]: Start difference. First operand 1509 states. Second operand 2 states. [2020-10-22 00:51:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:51:35,148 INFO L93 Difference]: Finished difference Result 1470 states and 3278 transitions. [2020-10-22 00:51:35,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-22 00:51:35,150 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2020-10-22 00:51:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:51:35,182 INFO L225 Difference]: With dead ends: 1470 [2020-10-22 00:51:35,182 INFO L226 Difference]: Without dead ends: 1431 [2020-10-22 00:51:35,184 INFO L677 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-10-22 00:51:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-10-22 00:51:35,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2020-10-22 00:51:35,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2020-10-22 00:51:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2020-10-22 00:51:35,341 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 1 [2020-10-22 00:51:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:51:35,342 INFO L481 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2020-10-22 00:51:35,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-22 00:51:35,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2020-10-22 00:51:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-10-22 00:51:35,343 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:35,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-22 00:51:35,343 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:51:35,344 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:35,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1673217019, now seen corresponding path program 1 times [2020-10-22 00:51:35,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:35,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458396642] [2020-10-22 00:51:35,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:35,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458396642] [2020-10-22 00:51:35,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:35,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:51:35,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [721409161] [2020-10-22 00:51:35,465 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:35,466 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:35,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-10-22 00:51:35,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:35,468 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:51:35,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:51:35,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:51:35,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:51:35,470 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2020-10-22 00:51:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:51:35,531 INFO L93 Difference]: Finished difference Result 2685 states and 6008 transitions. [2020-10-22 00:51:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:51:35,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-10-22 00:51:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:51:35,550 INFO L225 Difference]: With dead ends: 2685 [2020-10-22 00:51:35,551 INFO L226 Difference]: Without dead ends: 2685 [2020-10-22 00:51:35,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-22 00:51:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2020-10-22 00:51:35,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 1450. [2020-10-22 00:51:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-22 00:51:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 3237 transitions. [2020-10-22 00:51:35,612 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 3237 transitions. Word has length 6 [2020-10-22 00:51:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:51:35,612 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 3237 transitions. [2020-10-22 00:51:35,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:51:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 3237 transitions. [2020-10-22 00:51:35,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 00:51:35,613 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:35,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:51:35,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:51:35,614 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:35,615 INFO L82 PathProgramCache]: Analyzing trace with hash 330400010, now seen corresponding path program 1 times [2020-10-22 00:51:35,619 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:35,619 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194774955] [2020-10-22 00:51:35,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:35,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:35,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194774955] [2020-10-22 00:51:35,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:35,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:51:35,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [427593340] [2020-10-22 00:51:35,700 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:35,700 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:35,701 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 00:51:35,702 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:35,702 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:51:35,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:51:35,703 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:35,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:51:35,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:51:35,704 INFO L87 Difference]: Start difference. First operand 1450 states and 3237 transitions. Second operand 3 states. [2020-10-22 00:51:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:51:35,759 INFO L93 Difference]: Finished difference Result 1450 states and 3218 transitions. [2020-10-22 00:51:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:51:35,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 00:51:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:51:35,769 INFO L225 Difference]: With dead ends: 1450 [2020-10-22 00:51:35,769 INFO L226 Difference]: Without dead ends: 1450 [2020-10-22 00:51:35,770 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-22 00:51:35,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-22 00:51:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-22 00:51:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-22 00:51:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 3218 transitions. [2020-10-22 00:51:35,809 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 3218 transitions. Word has length 7 [2020-10-22 00:51:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:51:35,809 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 3218 transitions. [2020-10-22 00:51:35,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:51:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 3218 transitions. [2020-10-22 00:51:35,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 00:51:35,810 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:35,811 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:51:35,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:51:35,811 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:35,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1664981825, now seen corresponding path program 1 times [2020-10-22 00:51:35,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:35,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008628172] [2020-10-22 00:51:35,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:35,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:35,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008628172] [2020-10-22 00:51:35,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:35,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:51:35,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [909233516] [2020-10-22 00:51:35,952 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:35,953 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:35,954 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-22 00:51:35,955 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:35,955 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:51:35,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:51:35,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:35,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:51:35,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:51:35,956 INFO L87 Difference]: Start difference. First operand 1450 states and 3218 transitions. Second operand 5 states. [2020-10-22 00:51:36,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:51:36,411 INFO L93 Difference]: Finished difference Result 1826 states and 4058 transitions. [2020-10-22 00:51:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:51:36,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-22 00:51:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:51:36,423 INFO L225 Difference]: With dead ends: 1826 [2020-10-22 00:51:36,423 INFO L226 Difference]: Without dead ends: 1826 [2020-10-22 00:51:36,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:51:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2020-10-22 00:51:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1557. [2020-10-22 00:51:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1557 states. [2020-10-22 00:51:36,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 3463 transitions. [2020-10-22 00:51:36,466 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 3463 transitions. Word has length 8 [2020-10-22 00:51:36,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:51:36,467 INFO L481 AbstractCegarLoop]: Abstraction has 1557 states and 3463 transitions. [2020-10-22 00:51:36,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:51:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 3463 transitions. [2020-10-22 00:51:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:51:36,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:36,469 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:51:36,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:51:36,469 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:36,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:36,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1975126375, now seen corresponding path program 1 times [2020-10-22 00:51:36,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:36,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275103617] [2020-10-22 00:51:36,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:36,539 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275103617] [2020-10-22 00:51:36,539 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:36,539 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:51:36,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1595107191] [2020-10-22 00:51:36,540 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:36,542 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:36,544 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:51:36,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:36,546 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:51:36,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:51:36,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:36,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:51:36,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:51:36,550 INFO L87 Difference]: Start difference. First operand 1557 states and 3463 transitions. Second operand 3 states. [2020-10-22 00:51:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:51:36,634 INFO L93 Difference]: Finished difference Result 2565 states and 5690 transitions. [2020-10-22 00:51:36,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:51:36,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-22 00:51:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:51:36,650 INFO L225 Difference]: With dead ends: 2565 [2020-10-22 00:51:36,651 INFO L226 Difference]: Without dead ends: 2565 [2020-10-22 00:51:36,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-22 00:51:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2565 states. [2020-10-22 00:51:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2565 to 1614. [2020-10-22 00:51:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-22 00:51:36,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 3583 transitions. [2020-10-22 00:51:36,706 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 3583 transitions. Word has length 10 [2020-10-22 00:51:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:51:36,706 INFO L481 AbstractCegarLoop]: Abstraction has 1614 states and 3583 transitions. [2020-10-22 00:51:36,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:51:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 3583 transitions. [2020-10-22 00:51:36,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:51:36,715 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:36,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:51:36,716 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:51:36,716 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:36,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1249348263, now seen corresponding path program 1 times [2020-10-22 00:51:36,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:36,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680499093] [2020-10-22 00:51:36,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:36,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:36,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680499093] [2020-10-22 00:51:36,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:36,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-22 00:51:36,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1923538020] [2020-10-22 00:51:36,921 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:36,924 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:36,931 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 38 transitions. [2020-10-22 00:51:36,931 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:37,012 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:51:37,012 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:51:37,017 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:51:37,017 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_162| vanished before elimination [2020-10-22 00:51:37,017 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:51:37,018 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:13 [2020-10-22 00:51:37,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:51:37,085 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:51:37,086 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:51:37,089 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:51:37,089 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:51:37,095 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:51:37,095 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:51:37,096 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:14 [2020-10-22 00:51:39,463 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2020-10-22 00:51:39,465 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [28512#(and (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base)), 28510#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 28511#(and (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)))] [2020-10-22 00:51:39,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 00:51:39,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:39,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 00:51:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:51:39,466 INFO L87 Difference]: Start difference. First operand 1614 states and 3583 transitions. Second operand 13 states. [2020-10-22 00:51:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:51:41,211 INFO L93 Difference]: Finished difference Result 1960 states and 4341 transitions. [2020-10-22 00:51:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-22 00:51:41,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2020-10-22 00:51:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:51:41,222 INFO L225 Difference]: With dead ends: 1960 [2020-10-22 00:51:41,223 INFO L226 Difference]: Without dead ends: 1960 [2020-10-22 00:51:41,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2020-10-22 00:51:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1960 states. [2020-10-22 00:51:41,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1960 to 1623. [2020-10-22 00:51:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1623 states. [2020-10-22 00:51:41,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 3603 transitions. [2020-10-22 00:51:41,266 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 3603 transitions. Word has length 14 [2020-10-22 00:51:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:51:41,266 INFO L481 AbstractCegarLoop]: Abstraction has 1623 states and 3603 transitions. [2020-10-22 00:51:41,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 00:51:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 3603 transitions. [2020-10-22 00:51:41,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:51:41,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:41,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:51:41,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:51:41,268 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:41,269 INFO L82 PathProgramCache]: Analyzing trace with hash 38942986, now seen corresponding path program 1 times [2020-10-22 00:51:41,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:41,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654651974] [2020-10-22 00:51:41,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:41,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:41,420 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654651974] [2020-10-22 00:51:41,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:41,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-22 00:51:41,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1147813758] [2020-10-22 00:51:41,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:41,424 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:41,427 INFO L252 McrAutomatonBuilder]: Finished intersection with 15 states and 14 transitions. [2020-10-22 00:51:41,428 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:41,428 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:51:41,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-22 00:51:41,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-22 00:51:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:51:41,429 INFO L87 Difference]: Start difference. First operand 1623 states and 3603 transitions. Second operand 8 states. [2020-10-22 00:51:42,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:51:42,493 INFO L93 Difference]: Finished difference Result 2539 states and 5666 transitions. [2020-10-22 00:51:42,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-22 00:51:42,494 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2020-10-22 00:51:42,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:51:42,505 INFO L225 Difference]: With dead ends: 2539 [2020-10-22 00:51:42,505 INFO L226 Difference]: Without dead ends: 2502 [2020-10-22 00:51:42,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-10-22 00:51:42,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2020-10-22 00:51:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1901. [2020-10-22 00:51:42,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1901 states. [2020-10-22 00:51:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 4285 transitions. [2020-10-22 00:51:42,557 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 4285 transitions. Word has length 14 [2020-10-22 00:51:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:51:42,557 INFO L481 AbstractCegarLoop]: Abstraction has 1901 states and 4285 transitions. [2020-10-22 00:51:42,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-22 00:51:42,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 4285 transitions. [2020-10-22 00:51:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:51:42,559 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:51:42,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:51:42,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:51:42,559 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:51:42,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:51:42,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1611335451, now seen corresponding path program 1 times [2020-10-22 00:51:42,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:51:42,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156375525] [2020-10-22 00:51:42,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:51:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:51:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:51:43,063 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156375525] [2020-10-22 00:51:43,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:51:43,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:51:43,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [266788896] [2020-10-22 00:51:43,065 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:51:43,070 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:51:43,078 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 43 transitions. [2020-10-22 00:51:43,079 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:51:43,135 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_373|], 2=[|v_#memory_$Pointer$.base_374|]} [2020-10-22 00:51:43,137 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:51:43,146 INFO L625 ElimStorePlain]: treesize reduction 25, result has 34.2 percent of original size [2020-10-22 00:51:43,146 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_374| vanished before elimination [2020-10-22 00:51:43,147 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:51:43,147 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:13 [2020-10-22 00:51:44,074 WARN L193 SmtUtils]: Spent 805.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-22 00:51:44,855 WARN L193 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2020-10-22 00:51:48,342 WARN L193 SmtUtils]: Spent 3.39 s on a formula simplification that was a NOOP. DAG size: 89 [2020-10-22 00:51:58,967 WARN L193 SmtUtils]: Spent 10.56 s on a formula simplification. DAG size of input: 66 DAG size of output: 26 [2020-10-22 00:51:58,968 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [40108#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 40109#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem28.base|))), 40110#(and (= pusherThread1of1ForFork0_fifo_push_~t~0.offset 0) (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= |ULTIMATE.start_main_~#q~1.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 40111#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) 12) pusherThread1of1ForFork0_fifo_push_~self.base)) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0))), 40112#(and (not (= 0 (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|))) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.offset 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) 4) 0) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) 12))))] [2020-10-22 00:51:58,969 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-22 00:51:58,969 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:51:58,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-22 00:51:58,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2020-10-22 00:51:58,970 INFO L87 Difference]: Start difference. First operand 1901 states and 4285 transitions. Second operand 17 states. [2020-10-22 00:52:00,134 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 47 [2020-10-22 00:52:00,458 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 50 [2020-10-22 00:52:00,910 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 54 [2020-10-22 00:52:01,175 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 57 [2020-10-22 00:52:02,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:02,933 INFO L93 Difference]: Finished difference Result 2379 states and 5377 transitions. [2020-10-22 00:52:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-22 00:52:02,933 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-10-22 00:52:02,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:02,944 INFO L225 Difference]: With dead ends: 2379 [2020-10-22 00:52:02,944 INFO L226 Difference]: Without dead ends: 2379 [2020-10-22 00:52:02,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=327, Invalid=933, Unknown=0, NotChecked=0, Total=1260 [2020-10-22 00:52:02,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2020-10-22 00:52:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 1937. [2020-10-22 00:52:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1937 states. [2020-10-22 00:52:02,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1937 states to 1937 states and 4385 transitions. [2020-10-22 00:52:02,992 INFO L78 Accepts]: Start accepts. Automaton has 1937 states and 4385 transitions. Word has length 15 [2020-10-22 00:52:02,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:02,992 INFO L481 AbstractCegarLoop]: Abstraction has 1937 states and 4385 transitions. [2020-10-22 00:52:02,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-22 00:52:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1937 states and 4385 transitions. [2020-10-22 00:52:02,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:52:02,994 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:02,994 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:02,994 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:52:02,995 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:02,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:02,995 INFO L82 PathProgramCache]: Analyzing trace with hash -348384689, now seen corresponding path program 1 times [2020-10-22 00:52:03,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:03,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282582284] [2020-10-22 00:52:03,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:03,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:52:03,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282582284] [2020-10-22 00:52:03,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:03,149 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-22 00:52:03,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142646319] [2020-10-22 00:52:03,150 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:03,151 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:03,156 INFO L252 McrAutomatonBuilder]: Finished intersection with 30 states and 43 transitions. [2020-10-22 00:52:03,157 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:03,203 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:03,203 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:03,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:03,205 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_166| vanished before elimination [2020-10-22 00:52:03,205 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-22 00:52:03,205 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:16 [2020-10-22 00:52:03,257 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:03,258 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:03,261 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:03,261 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:03,263 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:03,263 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:03,271 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:03,271 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_167| vanished before elimination [2020-10-22 00:52:03,271 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:52:03,271 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:133, output treesize:16 [2020-10-22 00:52:03,310 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:52:07,340 WARN L193 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 46 DAG size of output: 12 [2020-10-22 00:52:07,341 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [46415#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 46416#(not (or (and (= pusherThread1of1ForFork0_fifo_node_init_~self.base 0) (= |ULTIMATE.start_main_~#q~1.offset| pusherThread1of1ForFork0_fifo_node_init_~self.offset) (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0) (not (and (= |ULTIMATE.start_main_~#q~1.offset| pusherThread1of1ForFork0_fifo_node_init_~self.offset) (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)))))), 46417#(and (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| 0)) (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| |ULTIMATE.start_main_~#q~1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 46418#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)))] [2020-10-22 00:52:07,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-22 00:52:07,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-22 00:52:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:52:07,343 INFO L87 Difference]: Start difference. First operand 1937 states and 4385 transitions. Second operand 15 states. [2020-10-22 00:52:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:09,507 INFO L93 Difference]: Finished difference Result 2351 states and 5288 transitions. [2020-10-22 00:52:09,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-22 00:52:09,507 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2020-10-22 00:52:09,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:09,519 INFO L225 Difference]: With dead ends: 2351 [2020-10-22 00:52:09,519 INFO L226 Difference]: Without dead ends: 2351 [2020-10-22 00:52:09,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2020-10-22 00:52:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2020-10-22 00:52:09,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 1955. [2020-10-22 00:52:09,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2020-10-22 00:52:09,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 4426 transitions. [2020-10-22 00:52:09,564 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 4426 transitions. Word has length 15 [2020-10-22 00:52:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:09,565 INFO L481 AbstractCegarLoop]: Abstraction has 1955 states and 4426 transitions. [2020-10-22 00:52:09,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-22 00:52:09,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 4426 transitions. [2020-10-22 00:52:09,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-22 00:52:09,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:09,567 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:09,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:52:09,567 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:09,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:09,567 INFO L82 PathProgramCache]: Analyzing trace with hash 2085397490, now seen corresponding path program 1 times [2020-10-22 00:52:09,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:09,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682674388] [2020-10-22 00:52:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:52:09,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682674388] [2020-10-22 00:52:09,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:09,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:52:09,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1464902108] [2020-10-22 00:52:09,740 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:09,742 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:09,749 INFO L252 McrAutomatonBuilder]: Finished intersection with 33 states and 48 transitions. [2020-10-22 00:52:09,750 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:09,809 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:09,812 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:09,812 INFO L513 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2020-10-22 00:52:09,813 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-22 00:52:09,813 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:58, output treesize:18 [2020-10-22 00:52:09,892 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:09,893 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:09,908 INFO L625 ElimStorePlain]: treesize reduction 11, result has 65.6 percent of original size [2020-10-22 00:52:09,908 INFO L513 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2020-10-22 00:52:09,909 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:52:09,909 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:21 [2020-10-22 00:52:09,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:52:10,025 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:10,026 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:10,028 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:10,028 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:10,033 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:10,034 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_172| vanished before elimination [2020-10-22 00:52:10,034 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:52:10,034 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:13 [2020-10-22 00:52:10,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:52:10,083 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:10,083 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:10,086 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:10,087 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:10,091 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:10,091 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:52:10,092 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:14 [2020-10-22 00:52:10,420 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [52716#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 52717#(not (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0) (and (= |ULTIMATE.start_main_~#q~1.offset| (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 16)) (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)))), 52718#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|))), 52719#(and (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 52720#(and (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base))] [2020-10-22 00:52:10,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-22 00:52:10,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:10,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-22 00:52:10,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-10-22 00:52:10,422 INFO L87 Difference]: Start difference. First operand 1955 states and 4426 transitions. Second operand 17 states. [2020-10-22 00:52:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:12,760 INFO L93 Difference]: Finished difference Result 2448 states and 5498 transitions. [2020-10-22 00:52:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-22 00:52:12,761 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2020-10-22 00:52:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:12,775 INFO L225 Difference]: With dead ends: 2448 [2020-10-22 00:52:12,775 INFO L226 Difference]: Without dead ends: 2448 [2020-10-22 00:52:12,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=204, Invalid=552, Unknown=0, NotChecked=0, Total=756 [2020-10-22 00:52:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2020-10-22 00:52:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 1989. [2020-10-22 00:52:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2020-10-22 00:52:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 4504 transitions. [2020-10-22 00:52:12,819 INFO L78 Accepts]: Start accepts. Automaton has 1989 states and 4504 transitions. Word has length 16 [2020-10-22 00:52:12,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:12,820 INFO L481 AbstractCegarLoop]: Abstraction has 1989 states and 4504 transitions. [2020-10-22 00:52:12,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-22 00:52:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states and 4504 transitions. [2020-10-22 00:52:12,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:52:12,821 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:12,821 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:12,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:52:12,822 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:12,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:12,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1784687491, now seen corresponding path program 1 times [2020-10-22 00:52:12,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:12,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268696210] [2020-10-22 00:52:12,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:52:13,120 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268696210] [2020-10-22 00:52:13,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:13,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:52:13,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2135865761] [2020-10-22 00:52:13,121 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:13,123 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:13,133 INFO L252 McrAutomatonBuilder]: Finished intersection with 36 states and 53 transitions. [2020-10-22 00:52:13,134 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:13,200 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:13,201 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:13,205 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:13,205 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_176| vanished before elimination [2020-10-22 00:52:13,205 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:52:13,206 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:13 [2020-10-22 00:52:13,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:52:13,293 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_387|], 2=[|v_#memory_$Pointer$.base_388|]} [2020-10-22 00:52:13,295 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:13,297 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:13,314 INFO L625 ElimStorePlain]: treesize reduction 46, result has 27.0 percent of original size [2020-10-22 00:52:13,314 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_388| vanished before elimination [2020-10-22 00:52:13,315 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:52:13,315 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:95, output treesize:17 [2020-10-22 00:52:18,389 WARN L193 SmtUtils]: Spent 4.70 s on a formula simplification that was a NOOP. DAG size: 89 [2020-10-22 00:52:19,395 WARN L193 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 26 [2020-10-22 00:52:19,396 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 6 new interpolants: [59181#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 59182#(and (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 59183#(and (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem28.base|))), 59184#(and (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= |ULTIMATE.start_main_~#q~1.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 59185#(and (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12)) pusherThread1of1ForFork0_fifo_push_~self.base)) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) |ULTIMATE.start_main_~#q~1.base|)) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0))), 59186#(and (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) 4) 0) (not (= 0 (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|))) (= pusherThread1of1ForFork0_~q~0.offset 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) 4)) 12) pusherThread1of1ForFork0_~q~0.base)) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) 4))))] [2020-10-22 00:52:19,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-22 00:52:19,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:19,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-22 00:52:19,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:52:19,397 INFO L87 Difference]: Start difference. First operand 1989 states and 4504 transitions. Second operand 18 states. [2020-10-22 00:52:20,675 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 54 [2020-10-22 00:52:21,034 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 57 [2020-10-22 00:52:21,507 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2020-10-22 00:52:21,797 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 60 [2020-10-22 00:52:23,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:23,925 INFO L93 Difference]: Finished difference Result 3023 states and 6825 transitions. [2020-10-22 00:52:23,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-22 00:52:23,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2020-10-22 00:52:23,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:23,934 INFO L225 Difference]: With dead ends: 3023 [2020-10-22 00:52:23,934 INFO L226 Difference]: Without dead ends: 3023 [2020-10-22 00:52:23,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=360, Invalid=1122, Unknown=0, NotChecked=0, Total=1482 [2020-10-22 00:52:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2020-10-22 00:52:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2164. [2020-10-22 00:52:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2164 states. [2020-10-22 00:52:23,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 4938 transitions. [2020-10-22 00:52:23,985 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 4938 transitions. Word has length 17 [2020-10-22 00:52:23,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:23,986 INFO L481 AbstractCegarLoop]: Abstraction has 2164 states and 4938 transitions. [2020-10-22 00:52:23,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-22 00:52:23,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 4938 transitions. [2020-10-22 00:52:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:52:23,987 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:23,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:23,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:52:23,988 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:23,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:23,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1330492557, now seen corresponding path program 1 times [2020-10-22 00:52:23,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:23,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165250098] [2020-10-22 00:52:23,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:24,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:52:24,085 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165250098] [2020-10-22 00:52:24,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:24,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:52:24,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [62013529] [2020-10-22 00:52:24,086 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:24,089 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:24,093 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 17 transitions. [2020-10-22 00:52:24,093 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:24,094 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:52:24,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:52:24,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:52:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:52:24,095 INFO L87 Difference]: Start difference. First operand 2164 states and 4938 transitions. Second operand 6 states. [2020-10-22 00:52:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:24,705 INFO L93 Difference]: Finished difference Result 2448 states and 5541 transitions. [2020-10-22 00:52:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:52:24,706 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-22 00:52:24,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:24,713 INFO L225 Difference]: With dead ends: 2448 [2020-10-22 00:52:24,713 INFO L226 Difference]: Without dead ends: 2448 [2020-10-22 00:52:24,718 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-10-22 00:52:24,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2020-10-22 00:52:24,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2298. [2020-10-22 00:52:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2298 states. [2020-10-22 00:52:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 5226 transitions. [2020-10-22 00:52:24,768 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 5226 transitions. Word has length 17 [2020-10-22 00:52:24,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:24,771 INFO L481 AbstractCegarLoop]: Abstraction has 2298 states and 5226 transitions. [2020-10-22 00:52:24,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:52:24,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 5226 transitions. [2020-10-22 00:52:24,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:52:24,773 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:24,773 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:24,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:52:24,774 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:24,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1800007828, now seen corresponding path program 1 times [2020-10-22 00:52:24,776 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:24,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193310032] [2020-10-22 00:52:24,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:25,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:52:25,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193310032] [2020-10-22 00:52:25,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:25,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-22 00:52:25,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [465752502] [2020-10-22 00:52:25,109 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:25,114 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:25,123 INFO L252 McrAutomatonBuilder]: Finished intersection with 39 states and 58 transitions. [2020-10-22 00:52:25,124 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:25,184 INFO L441 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_389|], 2=[|v_#memory_$Pointer$.base_390|]} [2020-10-22 00:52:25,188 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:25,188 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,193 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:25,193 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_389| vanished before elimination [2020-10-22 00:52:25,193 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_390| vanished before elimination [2020-10-22 00:52:25,194 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:52:25,194 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:54, output treesize:13 [2020-10-22 00:52:25,287 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,289 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,290 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:25,301 INFO L513 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2020-10-22 00:52:25,301 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:52:25,301 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:136, output treesize:37 [2020-10-22 00:52:25,399 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,400 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,401 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,403 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,426 INFO L625 ElimStorePlain]: treesize reduction 11, result has 77.1 percent of original size [2020-10-22 00:52:25,426 INFO L513 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2020-10-22 00:52:25,426 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:52:25,427 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:147, output treesize:37 [2020-10-22 00:52:25,631 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:25,631 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,632 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:25,632 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,636 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:25,636 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,642 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:25,643 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_186| vanished before elimination [2020-10-22 00:52:25,643 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:52:25,643 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:104, output treesize:16 [2020-10-22 00:52:25,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:52:25,716 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:25,716 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,719 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:25,719 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:25,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:52:25,724 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:52:25,725 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:14 [2020-10-22 00:52:27,323 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification that was a NOOP. DAG size: 73 [2020-10-22 00:52:27,449 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [73651#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem28.base|))), 73650#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 73653#(and (= pusherThread1of1ForFork0_fifo_node_init_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_node_init_~self.base) (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 12)) |ULTIMATE.start_main_~#q~1.base|)) (not (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0) (and (= |ULTIMATE.start_main_~#q~1.offset| (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 16)) (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|))))), 73652#(and (= pusherThread1of1ForFork0_fifo_push_~t~0.offset 0) (not (= |ULTIMATE.start_main_~#q~1.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 73655#(and (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| 0)), 73654#(and (= pusherThread1of1ForFork0_fifo_node_init_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_node_init_~self.base) (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 12)) |ULTIMATE.start_main_~#q~1.base|))), 73656#(and (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base))] [2020-10-22 00:52:27,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-22 00:52:27,450 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:27,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-22 00:52:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-10-22 00:52:27,451 INFO L87 Difference]: Start difference. First operand 2298 states and 5226 transitions. Second operand 21 states. [2020-10-22 00:52:29,222 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2020-10-22 00:52:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:31,766 INFO L93 Difference]: Finished difference Result 2738 states and 6212 transitions. [2020-10-22 00:52:31,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-22 00:52:31,767 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 18 [2020-10-22 00:52:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:31,776 INFO L225 Difference]: With dead ends: 2738 [2020-10-22 00:52:31,776 INFO L226 Difference]: Without dead ends: 2738 [2020-10-22 00:52:31,777 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=430, Invalid=1210, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:52:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2738 states. [2020-10-22 00:52:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2738 to 2366. [2020-10-22 00:52:31,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2020-10-22 00:52:31,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 5399 transitions. [2020-10-22 00:52:31,828 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 5399 transitions. Word has length 18 [2020-10-22 00:52:31,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:31,829 INFO L481 AbstractCegarLoop]: Abstraction has 2366 states and 5399 transitions. [2020-10-22 00:52:31,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-22 00:52:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 5399 transitions. [2020-10-22 00:52:31,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-22 00:52:31,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:31,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:31,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-22 00:52:31,832 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:31,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:31,832 INFO L82 PathProgramCache]: Analyzing trace with hash -635521939, now seen corresponding path program 1 times [2020-10-22 00:52:31,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:31,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124185883] [2020-10-22 00:52:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:52:32,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124185883] [2020-10-22 00:52:32,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:32,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-22 00:52:32,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388059552] [2020-10-22 00:52:32,377 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:32,379 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:32,383 INFO L252 McrAutomatonBuilder]: Finished intersection with 19 states and 18 transitions. [2020-10-22 00:52:32,384 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:32,384 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:52:32,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-22 00:52:32,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-22 00:52:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:52:32,385 INFO L87 Difference]: Start difference. First operand 2366 states and 5399 transitions. Second operand 15 states. [2020-10-22 00:52:35,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:52:35,048 INFO L93 Difference]: Finished difference Result 3870 states and 8760 transitions. [2020-10-22 00:52:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-22 00:52:35,049 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-10-22 00:52:35,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:52:35,056 INFO L225 Difference]: With dead ends: 3870 [2020-10-22 00:52:35,057 INFO L226 Difference]: Without dead ends: 3870 [2020-10-22 00:52:35,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=659, Unknown=0, NotChecked=0, Total=870 [2020-10-22 00:52:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3870 states. [2020-10-22 00:52:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3870 to 2356. [2020-10-22 00:52:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2020-10-22 00:52:35,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 5368 transitions. [2020-10-22 00:52:35,114 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 5368 transitions. Word has length 18 [2020-10-22 00:52:35,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:52:35,114 INFO L481 AbstractCegarLoop]: Abstraction has 2356 states and 5368 transitions. [2020-10-22 00:52:35,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-22 00:52:35,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 5368 transitions. [2020-10-22 00:52:35,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:52:35,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:52:35,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:52:35,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-22 00:52:35,117 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:52:35,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:52:35,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1583149409, now seen corresponding path program 1 times [2020-10-22 00:52:35,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:52:35,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459720999] [2020-10-22 00:52:35,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:52:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:52:35,837 WARN L193 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 29 [2020-10-22 00:52:36,212 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2020-10-22 00:52:36,566 WARN L193 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2020-10-22 00:52:36,924 WARN L193 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 43 [2020-10-22 00:52:37,097 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 31 [2020-10-22 00:52:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:52:37,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459720999] [2020-10-22 00:52:37,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:52:37,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-22 00:52:37,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [449539666] [2020-10-22 00:52:37,349 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:52:37,352 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:52:37,362 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 68 transitions. [2020-10-22 00:52:37,363 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:52:37,424 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,424 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,449 INFO L625 ElimStorePlain]: treesize reduction 47, result has 27.7 percent of original size [2020-10-22 00:52:37,450 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_188| vanished before elimination [2020-10-22 00:52:37,450 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:52:37,450 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:104, output treesize:18 [2020-10-22 00:52:37,715 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:52:37,716 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:52:37,739 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,739 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,741 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,741 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,747 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,747 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,753 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,753 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,761 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,761 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,767 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,767 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,773 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,773 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,776 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:52:37,776 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:37,901 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2020-10-22 00:52:37,902 INFO L625 ElimStorePlain]: treesize reduction 36, result has 81.7 percent of original size [2020-10-22 00:52:37,902 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_189| vanished before elimination [2020-10-22 00:52:37,903 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-10-22 00:52:37,903 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:542, output treesize:161 [2020-10-22 00:52:38,104 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2020-10-22 00:52:38,288 INFO L603 QuantifierPusher]: Distributing 9 disjuncts over 2 conjuncts [2020-10-22 00:52:38,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:52:38,296 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:52:38,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:52:38,320 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,325 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:52:38,327 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,328 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,331 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,342 INFO L545 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:52:38,344 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,345 INFO L545 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,352 INFO L545 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:52:38,358 INFO L545 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,360 INFO L545 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:52:38,362 INFO L545 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-22 00:52:38,363 INFO L545 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2020-10-22 00:52:38,508 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 42 [2020-10-22 00:52:38,509 INFO L625 ElimStorePlain]: treesize reduction 446, result has 17.3 percent of original size [2020-10-22 00:52:38,509 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_399| vanished before elimination [2020-10-22 00:52:38,509 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 9 xjuncts. [2020-10-22 00:52:38,510 INFO L244 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:699, output treesize:93 [2020-10-22 00:52:38,873 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2020-10-22 00:52:39,496 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2020-10-22 00:52:45,061 WARN L193 SmtUtils]: Spent 5.31 s on a formula simplification that was a NOOP. DAG size: 91 [2020-10-22 00:52:50,997 WARN L193 SmtUtils]: Spent 5.85 s on a formula simplification. DAG size of input: 71 DAG size of output: 27 [2020-10-22 00:52:50,999 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 10 new interpolants: [89811#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (or (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= |pusherThread1of1ForFork0_fifo_push_#t~mem32.base| |ULTIMATE.start_main_~#q~1.base|)))), 89810#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 89813#(and (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (or (and (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)))) (and (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0)))) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0)), 89812#(and (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0)) (or (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) |ULTIMATE.start_main_~#q~1.base|)))), 89815#(and (or (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base)) (or (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (and (or (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))))) (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (or (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (and (or (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))))) (or (= (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4) (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (and (or (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))))) (or (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base)) (or (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0)) (and (or (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))))) (or (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0)))), 89814#(and (or (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base)) (or (and (not (and (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base) (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)))) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base)) (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (or (= (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4) |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset|) (and (not (and (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base) (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))))) (or (and (not (and (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base) (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)))) (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base))) (or (and (not (and (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base) (= pusherThread1of1ForFork0_fifo_push_~self.offset (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 8)))) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0))) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (or (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base)) (or (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0)))), 89817#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)))), 89816#(and (or (not (= |ULTIMATE.start_main_~#q~1.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset|)) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) 0)) (not (= pusherThread1of1ForFork0_fifo_push_~self.base pusherThread1of1ForFork0_fifo_push_~t~0.base)) (or (= (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4) (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) (not (= (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4) |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset|))) (or (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0))) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (or (not (= 0 pusherThread1of1ForFork0_fifo_push_~t~0.base)) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) 0)) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~t~0.base) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (= pusherThread1of1ForFork0_fifo_push_~t~0.offset (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)))), 89819#(and (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|) 0) (not (= 0 (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|))) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.offset 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (not (= pusherThread1of1ForFork0_~q~0.base 0)) (not (= pusherThread1of1ForFork0_~q~0.base (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)))) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 0))), 89818#(and (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0) (not (= pusherThread1of1ForFork0_fifo_push_~self.base 0)) (= |ULTIMATE.start_main_~#q~1.offset| 0) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) pusherThread1of1ForFork0_fifo_push_~self.base)) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 0)))] [2020-10-22 00:52:51,000 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-22 00:52:51,000 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:52:51,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-22 00:52:51,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2020-10-22 00:52:51,001 INFO L87 Difference]: Start difference. First operand 2356 states and 5368 transitions. Second operand 26 states. [2020-10-22 00:52:51,728 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 41 [2020-10-22 00:52:52,480 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 54 [2020-10-22 00:52:52,659 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 47 [2020-10-22 00:52:52,823 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 44 [2020-10-22 00:52:53,157 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 60 [2020-10-22 00:52:53,503 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2020-10-22 00:52:53,743 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2020-10-22 00:52:54,157 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2020-10-22 00:52:54,357 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 50 [2020-10-22 00:52:54,766 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2020-10-22 00:52:55,156 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 63 [2020-10-22 00:52:55,741 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2020-10-22 00:52:56,312 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 58 [2020-10-22 00:52:56,677 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 45 [2020-10-22 00:52:57,099 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2020-10-22 00:52:57,633 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 44 [2020-10-22 00:52:59,037 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 47 [2020-10-22 00:53:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:02,035 INFO L93 Difference]: Finished difference Result 3462 states and 7821 transitions. [2020-10-22 00:53:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2020-10-22 00:53:02,036 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 20 [2020-10-22 00:53:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:02,042 INFO L225 Difference]: With dead ends: 3462 [2020-10-22 00:53:02,042 INFO L226 Difference]: Without dead ends: 3462 [2020-10-22 00:53:02,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=698, Invalid=2842, Unknown=0, NotChecked=0, Total=3540 [2020-10-22 00:53:02,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2020-10-22 00:53:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 2374. [2020-10-22 00:53:02,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2020-10-22 00:53:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 5409 transitions. [2020-10-22 00:53:02,094 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 5409 transitions. Word has length 20 [2020-10-22 00:53:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:02,095 INFO L481 AbstractCegarLoop]: Abstraction has 2374 states and 5409 transitions. [2020-10-22 00:53:02,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-22 00:53:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 5409 transitions. [2020-10-22 00:53:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:53:02,098 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:02,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:02,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-22 00:53:02,098 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:02,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:02,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1269435534, now seen corresponding path program 1 times [2020-10-22 00:53:02,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:02,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135878329] [2020-10-22 00:53:02,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:53:02,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135878329] [2020-10-22 00:53:02,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:02,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-22 00:53:02,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [568077269] [2020-10-22 00:53:02,467 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:02,471 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:02,483 INFO L252 McrAutomatonBuilder]: Finished intersection with 45 states and 68 transitions. [2020-10-22 00:53:02,484 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:02,541 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,541 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,547 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:02,547 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_194| vanished before elimination [2020-10-22 00:53:02,548 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:53:02,548 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:16 [2020-10-22 00:53:02,620 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:53:02,634 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_404|, |#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_405|]} [2020-10-22 00:53:02,637 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,638 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,639 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,663 INFO L625 ElimStorePlain]: treesize reduction 66, result has 23.3 percent of original size [2020-10-22 00:53:02,663 INFO L513 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2020-10-22 00:53:02,663 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_405| vanished before elimination [2020-10-22 00:53:02,663 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:53:02,664 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:134, output treesize:20 [2020-10-22 00:53:02,784 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,785 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,793 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,794 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,798 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,798 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,799 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,800 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,811 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:02,811 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_196| vanished before elimination [2020-10-22 00:53:02,811 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:53:02,811 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:161, output treesize:37 [2020-10-22 00:53:02,890 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,891 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,892 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,893 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,894 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,895 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,896 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,897 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,907 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:02,907 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_197| vanished before elimination [2020-10-22 00:53:02,908 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2020-10-22 00:53:02,908 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:141, output treesize:37 [2020-10-22 00:53:02,932 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,932 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,940 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,940 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,943 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:02,943 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:02,948 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:02,948 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_198| vanished before elimination [2020-10-22 00:53:02,948 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:53:02,948 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:104, output treesize:16 [2020-10-22 00:53:02,995 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:53:03,009 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:03,009 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:03,010 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:03,011 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:03,015 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:03,016 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:53:03,016 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:14 [2020-10-22 00:53:05,179 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 73 [2020-10-22 00:53:07,121 WARN L193 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2020-10-22 00:53:07,122 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 7 new interpolants: [98113#(and (= pusherThread1of1ForFork0_fifo_push_~t~0.offset 0) (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 98112#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)), 98115#(and (= pusherThread1of1ForFork0_fifo_push_~t~0.offset 0) (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= |ULTIMATE.start_main_~#q~1.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0))), 98114#(and (= pusherThread1of1ForFork0_fifo_push_~t~0.offset 0) (not (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~t~0.base)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem28.base|))), 98117#(and (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| 0)), 98116#(and (= pusherThread1of1ForFork0_fifo_node_init_~self.offset 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_node_init_~self.base) (+ pusherThread1of1ForFork0_fifo_node_init_~self.offset 12)) |ULTIMATE.start_main_~#q~1.base|))), 98118#(and (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) 0)) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base))] [2020-10-22 00:53:07,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-22 00:53:07,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:07,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-22 00:53:07,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2020-10-22 00:53:07,123 INFO L87 Difference]: Start difference. First operand 2374 states and 5409 transitions. Second operand 21 states. [2020-10-22 00:53:08,872 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2020-10-22 00:53:09,577 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 53 [2020-10-22 00:53:09,886 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2020-10-22 00:53:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:11,834 INFO L93 Difference]: Finished difference Result 3471 states and 7881 transitions. [2020-10-22 00:53:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-10-22 00:53:11,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2020-10-22 00:53:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:11,840 INFO L225 Difference]: With dead ends: 3471 [2020-10-22 00:53:11,840 INFO L226 Difference]: Without dead ends: 3471 [2020-10-22 00:53:11,841 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2020-10-22 00:53:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3471 states. [2020-10-22 00:53:11,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3471 to 2527. [2020-10-22 00:53:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2527 states. [2020-10-22 00:53:11,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 5794 transitions. [2020-10-22 00:53:11,881 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 5794 transitions. Word has length 20 [2020-10-22 00:53:11,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:11,882 INFO L481 AbstractCegarLoop]: Abstraction has 2527 states and 5794 transitions. [2020-10-22 00:53:11,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-22 00:53:11,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 5794 transitions. [2020-10-22 00:53:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:53:11,884 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:11,884 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:11,884 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-22 00:53:11,884 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:11,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:11,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1574229656, now seen corresponding path program 1 times [2020-10-22 00:53:11,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:11,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404433022] [2020-10-22 00:53:11,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:53:12,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404433022] [2020-10-22 00:53:12,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:12,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-22 00:53:12,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [426846044] [2020-10-22 00:53:12,158 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:12,161 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:12,171 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 70 transitions. [2020-10-22 00:53:12,171 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:12,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:53:12,231 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:12,232 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,234 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:12,235 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,239 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:12,240 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:53:12,240 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2020-10-22 00:53:12,498 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:53:12,513 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:12,514 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,518 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:12,519 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,523 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:12,524 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,550 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:12,552 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:53:12,552 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:69, output treesize:36 [2020-10-22 00:53:12,687 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:53:12,704 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:12,704 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,706 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:12,706 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,710 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:12,710 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:12,724 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:12,725 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:53:12,725 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:104, output treesize:36 [2020-10-22 00:53:14,941 WARN L193 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 55 [2020-10-22 00:53:20,551 WARN L193 SmtUtils]: Spent 5.61 s on a formula simplification that was a NOOP. DAG size: 66 [2020-10-22 00:53:20,675 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 4 conjuncts [2020-10-22 00:53:20,694 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:20,695 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:20,701 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:20,702 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:20,710 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:20,715 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:20,722 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:20,723 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:20,730 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:20,730 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:20,737 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:20,744 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:20,750 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:20,751 INFO L545 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:20,951 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2020-10-22 00:53:20,952 INFO L625 ElimStorePlain]: treesize reduction 32, result has 85.2 percent of original size [2020-10-22 00:53:20,954 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2020-10-22 00:53:20,955 INFO L244 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:258, output treesize:136 [2020-10-22 00:53:39,680 WARN L193 SmtUtils]: Spent 18.49 s on a formula simplification that was a NOOP. DAG size: 88 [2020-10-22 00:53:39,770 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [106703#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|))), 106705#(and (or (not (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) 4) (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset))) (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) 4)))) (= ULTIMATE.start_fifo_front_~self.offset 0) (or (<= |#StackHeapBarrier| ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_front_~self.base 0))), 106704#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base)), 106706#(and (= (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_front_~self.base) (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base)) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset)) (= ULTIMATE.start_fifo_front_~self.offset 0) (= (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base)) (or (<= |#StackHeapBarrier| ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_front_~self.base 0)) (= ULTIMATE.start_fifo_empty_~self.offset 0) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|))] [2020-10-22 00:53:39,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-22 00:53:39,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:53:39,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-22 00:53:39,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-10-22 00:53:39,772 INFO L87 Difference]: Start difference. First operand 2527 states and 5794 transitions. Second operand 17 states. [2020-10-22 00:53:44,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:53:44,406 INFO L93 Difference]: Finished difference Result 5571 states and 12601 transitions. [2020-10-22 00:53:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-22 00:53:44,408 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2020-10-22 00:53:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:53:44,416 INFO L225 Difference]: With dead ends: 5571 [2020-10-22 00:53:44,416 INFO L226 Difference]: Without dead ends: 5552 [2020-10-22 00:53:44,417 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=354, Invalid=978, Unknown=0, NotChecked=0, Total=1332 [2020-10-22 00:53:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5552 states. [2020-10-22 00:53:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5552 to 2732. [2020-10-22 00:53:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2732 states. [2020-10-22 00:53:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 6264 transitions. [2020-10-22 00:53:44,473 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 6264 transitions. Word has length 20 [2020-10-22 00:53:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:53:44,474 INFO L481 AbstractCegarLoop]: Abstraction has 2732 states and 6264 transitions. [2020-10-22 00:53:44,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-22 00:53:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 6264 transitions. [2020-10-22 00:53:44,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-22 00:53:44,476 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:53:44,476 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:53:44,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-22 00:53:44,476 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:53:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:53:44,477 INFO L82 PathProgramCache]: Analyzing trace with hash 69989006, now seen corresponding path program 2 times [2020-10-22 00:53:44,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:53:44,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687935323] [2020-10-22 00:53:44,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:53:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:53:44,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:53:44,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687935323] [2020-10-22 00:53:44,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:53:44,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-22 00:53:44,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [160957868] [2020-10-22 00:53:44,791 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:53:44,794 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:53:44,809 INFO L252 McrAutomatonBuilder]: Finished intersection with 51 states and 80 transitions. [2020-10-22 00:53:44,810 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:53:44,818 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:53:44,829 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:44,830 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:44,835 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:44,836 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:44,840 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:44,842 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:44,864 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:44,866 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:53:44,866 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:21 [2020-10-22 00:53:44,994 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:53:45,000 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:45,003 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,005 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:45,006 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,008 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:45,008 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,020 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:45,020 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:53:45,020 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:81, output treesize:25 [2020-10-22 00:53:45,233 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-22 00:53:45,342 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 17 [2020-10-22 00:53:45,424 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:53:45,432 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:45,432 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,433 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:45,433 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,436 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:53:45,437 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,448 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:53:45,449 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:53:45,449 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:81, output treesize:25 [2020-10-22 00:53:45,568 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:53:45,580 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:45,581 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,590 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:45,595 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,605 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:45,605 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,611 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:45,612 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,619 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:45,625 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,631 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:53:45,632 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:53:45,838 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-10-22 00:53:45,839 INFO L625 ElimStorePlain]: treesize reduction 32, result has 82.1 percent of original size [2020-10-22 00:53:45,841 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2020-10-22 00:53:45,841 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:215, output treesize:107 [2020-10-22 00:53:48,193 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 50 [2020-10-22 00:53:50,386 WARN L193 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 93 [2020-10-22 00:53:58,645 WARN L193 SmtUtils]: Spent 8.25 s on a formula simplification that was a NOOP. DAG size: 63 [2020-10-22 00:54:06,946 WARN L193 SmtUtils]: Spent 8.29 s on a formula simplification that was a NOOP. DAG size: 80 [2020-10-22 00:54:07,177 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:54:07,186 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:07,186 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:07,188 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:07,189 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:07,191 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:07,192 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:07,198 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:54:07,199 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2020-10-22 00:54:07,199 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:75, output treesize:20 [2020-10-22 00:54:09,094 WARN L193 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 51 DAG size of output: 17 [2020-10-22 00:54:09,095 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [117797#(and (= ULTIMATE.start_fifo_front_~self.offset 0) (or (<= |#StackHeapBarrier| ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_front_~self.base 0)) (not (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) (+ ULTIMATE.start_fifo_front_~self.offset 4)) (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_front_~self.base) ULTIMATE.start_fifo_front_~self.offset)))), 117796#(and (not (= |ULTIMATE.start_fifo_empty_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) (+ ULTIMATE.start_fifo_empty_~self.offset 4)))) (or (= ULTIMATE.start_fifo_empty_~self.base 0) (<= |#StackHeapBarrier| ULTIMATE.start_fifo_empty_~self.base)) (= ULTIMATE.start_fifo_empty_~self.offset 0)), 117799#(and (= ULTIMATE.start_fifo_front_~self.offset 0) (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) (+ ULTIMATE.start_fifo_empty_~self.offset 4)) |ULTIMATE.start_fifo_empty_#t~mem6.base|) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (or (<= |#StackHeapBarrier| ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_front_~self.base 0)) (= ULTIMATE.start_fifo_empty_~self.offset 0) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|)), 117798#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|))), 117800#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)))] [2020-10-22 00:54:09,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-22 00:54:09,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:09,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-22 00:54:09,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2020-10-22 00:54:09,096 INFO L87 Difference]: Start difference. First operand 2732 states and 6264 transitions. Second operand 19 states. [2020-10-22 00:54:11,925 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2020-10-22 00:54:13,692 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2020-10-22 00:54:14,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:14,700 INFO L93 Difference]: Finished difference Result 4227 states and 9618 transitions. [2020-10-22 00:54:14,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-22 00:54:14,701 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 20 [2020-10-22 00:54:14,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:14,709 INFO L225 Difference]: With dead ends: 4227 [2020-10-22 00:54:14,710 INFO L226 Difference]: Without dead ends: 4207 [2020-10-22 00:54:14,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=480, Invalid=1412, Unknown=0, NotChecked=0, Total=1892 [2020-10-22 00:54:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4207 states. [2020-10-22 00:54:14,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4207 to 2762. [2020-10-22 00:54:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2762 states. [2020-10-22 00:54:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 6334 transitions. [2020-10-22 00:54:14,766 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 6334 transitions. Word has length 20 [2020-10-22 00:54:14,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:14,767 INFO L481 AbstractCegarLoop]: Abstraction has 2762 states and 6334 transitions. [2020-10-22 00:54:14,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-22 00:54:14,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 6334 transitions. [2020-10-22 00:54:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:54:14,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:14,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:14,771 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-22 00:54:14,771 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:54:14,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:14,772 INFO L82 PathProgramCache]: Analyzing trace with hash 709617572, now seen corresponding path program 1 times [2020-10-22 00:54:14,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:14,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005344686] [2020-10-22 00:54:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:14,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:54:14,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005344686] [2020-10-22 00:54:14,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:14,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-22 00:54:14,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [280647404] [2020-10-22 00:54:14,977 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:14,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:15,007 INFO L252 McrAutomatonBuilder]: Finished intersection with 52 states and 81 transitions. [2020-10-22 00:54:15,007 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:17,349 WARN L193 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 79 [2020-10-22 00:54:23,440 WARN L193 SmtUtils]: Spent 5.93 s on a formula simplification that was a NOOP. DAG size: 50 [2020-10-22 00:54:25,691 WARN L193 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2020-10-22 00:54:27,468 WARN L193 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 50 DAG size of output: 18 [2020-10-22 00:54:27,469 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [127611#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)))] [2020-10-22 00:54:27,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-22 00:54:27,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:27,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-22 00:54:27,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-22 00:54:27,471 INFO L87 Difference]: Start difference. First operand 2762 states and 6334 transitions. Second operand 10 states. [2020-10-22 00:54:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:28,937 INFO L93 Difference]: Finished difference Result 3890 states and 8862 transitions. [2020-10-22 00:54:28,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-22 00:54:28,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-22 00:54:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:28,946 INFO L225 Difference]: With dead ends: 3890 [2020-10-22 00:54:28,946 INFO L226 Difference]: Without dead ends: 3890 [2020-10-22 00:54:28,947 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-10-22 00:54:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states. [2020-10-22 00:54:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 2662. [2020-10-22 00:54:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2662 states. [2020-10-22 00:54:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 6077 transitions. [2020-10-22 00:54:28,995 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 6077 transitions. Word has length 21 [2020-10-22 00:54:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:28,995 INFO L481 AbstractCegarLoop]: Abstraction has 2662 states and 6077 transitions. [2020-10-22 00:54:28,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-22 00:54:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 6077 transitions. [2020-10-22 00:54:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:54:28,998 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:28,998 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:28,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-22 00:54:28,999 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:54:28,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:28,999 INFO L82 PathProgramCache]: Analyzing trace with hash 388790564, now seen corresponding path program 2 times [2020-10-22 00:54:29,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:29,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690331133] [2020-10-22 00:54:29,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:54:29,830 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690331133] [2020-10-22 00:54:29,831 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:29,831 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-22 00:54:29,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [962613070] [2020-10-22 00:54:29,831 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:29,834 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:29,843 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 57 transitions. [2020-10-22 00:54:29,843 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:32,387 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 67 DAG size of output: 35 [2020-10-22 00:54:37,220 WARN L193 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 101 [2020-10-22 00:54:38,920 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 94 DAG size of output: 48 [2020-10-22 00:54:39,026 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 8 new interpolants: [136850#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_fifo_push_#t~mem28.base|) 4))) (not (= |ULTIMATE.start_main_~#q~1.base| |pusherThread1of1ForFork0_fifo_push_#t~mem28.base|)))), 136851#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) 4) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|))) (not (= |ULTIMATE.start_main_~#q~1.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)))))), 136854#(and (= ULTIMATE.start_fifo_empty_~self.offset 0) (or (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12)) ULTIMATE.start_fifo_empty_~self.base)) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12))) ULTIMATE.start_fifo_front_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.base|) (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12)) ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12))) ULTIMATE.start_fifo_front_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= |ULTIMATE.start_fifo_empty_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12))) 4))))), 136855#(and (or (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12))) 4) |ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12)) ULTIMATE.start_fifo_front_~self.base) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= |ULTIMATE.start_fifo_empty_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12))) ULTIMATE.start_fifo_front_~self.offset)) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12))) ULTIMATE.start_fifo_front_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.base|)) (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12)) ULTIMATE.start_fifo_empty_~self.base)) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|))) (= ULTIMATE.start_fifo_empty_~self.offset 0)), 136852#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= |ULTIMATE.start_main_~#q~1.base| pusherThread1of1ForFork0_fifo_push_~self.base) (or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12)) |ULTIMATE.start_main_~#q~1.base|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12))) 4)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_fifo_push_~self.base) (+ pusherThread1of1ForFork0_fifo_push_~self.offset 4)) 12))) 4)))) (= pusherThread1of1ForFork0_fifo_push_~self.offset 0)), 136853#(and (or (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) 4) |ULTIMATE.start_fifo_empty_#t~mem6.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) ULTIMATE.start_fifo_front_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.base|) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) ULTIMATE.start_fifo_front_~self.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) 4) |ULTIMATE.start_fifo_empty_#t~mem6.offset|) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12))) ULTIMATE.start_fifo_front_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|)) (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (not (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_fifo_push_~t~0.base) (+ pusherThread1of1ForFork0_fifo_push_~t~0.offset 12)) ULTIMATE.start_fifo_empty_~self.base)) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|))) (= ULTIMATE.start_fifo_empty_~self.offset 0)), 136856#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.offset 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12))) 4)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12))) 4) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#q~1.base|) |ULTIMATE.start_main_~#q~1.offset|))) (not (= |ULTIMATE.start_main_~#q~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4))) (+ (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) (+ pusherThread1of1ForFork0_~q~0.offset 4)) 12))))) (or (and (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|) (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) 4)) (= (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) 4) (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) |ULTIMATE.start_main_~#q~1.offset|))) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) 4)) 12) (select (select |#memory_$Pointer$.base| pusherThread1of1ForFork0_~q~0.base) 4)) (= (select (select |#memory_$Pointer$.offset| pusherThread1of1ForFork0_~q~0.base) 4) 0)))), 136857#(and (or (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) 12)) ULTIMATE.start_fifo_empty_~self.base)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|)) (and (= ULTIMATE.start_fifo_front_~self.offset ULTIMATE.start_fifo_empty_~self.offset) (= |ULTIMATE.start_fifo_empty_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) 12))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) 12)) ULTIMATE.start_fifo_front_~self.base) (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) 12))) 4)) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (= |ULTIMATE.start_fifo_empty_#t~mem6.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) 12))) ULTIMATE.start_fifo_front_~self.offset)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4))) (+ (select (select |#memory_$Pointer$.offset| |pusherThread1of1ForFork0_#in~q_.base|) (+ |pusherThread1of1ForFork0_#in~q_.offset| 4)) 12))) ULTIMATE.start_fifo_front_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.base|))) (= ULTIMATE.start_fifo_empty_~self.offset 0))] [2020-10-22 00:54:39,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-22 00:54:39,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-22 00:54:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2020-10-22 00:54:39,028 INFO L87 Difference]: Start difference. First operand 2662 states and 6077 transitions. Second operand 22 states. [2020-10-22 00:54:39,694 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 44 [2020-10-22 00:54:40,022 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 62 [2020-10-22 00:54:40,311 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 57 [2020-10-22 00:54:40,647 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 76 [2020-10-22 00:54:40,843 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 71 [2020-10-22 00:54:41,096 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2020-10-22 00:54:41,324 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 77 [2020-10-22 00:54:41,654 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 92 [2020-10-22 00:54:41,972 WARN L193 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 95 [2020-10-22 00:54:42,466 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 106 [2020-10-22 00:54:45,124 WARN L193 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 122 [2020-10-22 00:54:45,534 WARN L193 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 112 [2020-10-22 00:54:46,072 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 68 [2020-10-22 00:54:46,379 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2020-10-22 00:54:47,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:47,062 INFO L93 Difference]: Finished difference Result 2958 states and 6759 transitions. [2020-10-22 00:54:47,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-22 00:54:47,063 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2020-10-22 00:54:47,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:47,068 INFO L225 Difference]: With dead ends: 2958 [2020-10-22 00:54:47,069 INFO L226 Difference]: Without dead ends: 2938 [2020-10-22 00:54:47,069 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=345, Invalid=1461, Unknown=0, NotChecked=0, Total=1806 [2020-10-22 00:54:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2020-10-22 00:54:47,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2660. [2020-10-22 00:54:47,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2020-10-22 00:54:47,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 6070 transitions. [2020-10-22 00:54:47,113 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 6070 transitions. Word has length 21 [2020-10-22 00:54:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:47,113 INFO L481 AbstractCegarLoop]: Abstraction has 2660 states and 6070 transitions. [2020-10-22 00:54:47,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-22 00:54:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 6070 transitions. [2020-10-22 00:54:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:54:47,116 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:47,116 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:47,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-22 00:54:47,117 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:54:47,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:47,117 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784664, now seen corresponding path program 1 times [2020-10-22 00:54:47,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:47,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120171580] [2020-10-22 00:54:47,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:47,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:54:47,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120171580] [2020-10-22 00:54:47,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:47,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-22 00:54:47,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1764443898] [2020-10-22 00:54:47,392 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:47,396 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:47,407 INFO L252 McrAutomatonBuilder]: Finished intersection with 34 states and 45 transitions. [2020-10-22 00:54:47,408 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:47,480 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:47,480 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:47,483 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:47,483 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:47,488 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:54:47,489 INFO L513 ElimStorePlain]: Eliminatee |v_#memory_int_204| vanished before elimination [2020-10-22 00:54:47,489 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:54:47,489 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:8 [2020-10-22 00:54:47,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:54:47,565 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:47,566 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:47,569 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:47,569 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:47,574 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:54:47,574 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:54:47,574 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2020-10-22 00:54:48,062 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-10-22 00:54:48,131 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [145190#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|))), 145189#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= pusherThread1of1ForFork0_fifo_node_init_~self.base |ULTIMATE.start_main_~#q~1.base|)))] [2020-10-22 00:54:48,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-22 00:54:48,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-22 00:54:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-10-22 00:54:48,133 INFO L87 Difference]: Start difference. First operand 2660 states and 6070 transitions. Second operand 13 states. [2020-10-22 00:54:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:54:50,638 INFO L93 Difference]: Finished difference Result 4948 states and 11174 transitions. [2020-10-22 00:54:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-22 00:54:50,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2020-10-22 00:54:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:54:50,648 INFO L225 Difference]: With dead ends: 4948 [2020-10-22 00:54:50,649 INFO L226 Difference]: Without dead ends: 4925 [2020-10-22 00:54:50,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2020-10-22 00:54:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2020-10-22 00:54:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 3992. [2020-10-22 00:54:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3992 states. [2020-10-22 00:54:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3992 states to 3992 states and 9338 transitions. [2020-10-22 00:54:50,744 INFO L78 Accepts]: Start accepts. Automaton has 3992 states and 9338 transitions. Word has length 21 [2020-10-22 00:54:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:54:50,744 INFO L481 AbstractCegarLoop]: Abstraction has 3992 states and 9338 transitions. [2020-10-22 00:54:50,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-22 00:54:50,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3992 states and 9338 transitions. [2020-10-22 00:54:50,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:54:50,747 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:54:50,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:54:50,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-22 00:54:50,748 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:54:50,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:54:50,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1967788080, now seen corresponding path program 2 times [2020-10-22 00:54:50,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:54:50,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014839720] [2020-10-22 00:54:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:54:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:54:51,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:54:51,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014839720] [2020-10-22 00:54:51,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:54:51,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-10-22 00:54:51,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [930665855] [2020-10-22 00:54:51,129 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:54:51,133 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:54:51,144 INFO L252 McrAutomatonBuilder]: Finished intersection with 37 states and 51 transitions. [2020-10-22 00:54:51,145 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:54:51,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:54:51,212 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:51,213 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,217 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:54:51,218 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,222 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:54:51,222 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:54:51,222 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2020-10-22 00:54:51,302 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:54:51,319 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:54:51,320 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,326 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:54:51,326 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,332 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:54:51,334 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,339 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:54:51,340 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,346 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:54:51,346 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,351 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:54:51,352 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:54:51,398 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:54:51,399 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:54:51,399 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:107, output treesize:31 [2020-10-22 00:54:53,590 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 56 [2020-10-22 00:54:55,734 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 67 [2020-10-22 00:54:57,847 WARN L193 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 47 DAG size of output: 11 [2020-10-22 00:54:57,890 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [158162#(and (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset)) (= ULTIMATE.start_fifo_front_~self.offset 0) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (or (= ULTIMATE.start_fifo_empty_~self.base 0) (<= |#StackHeapBarrier| ULTIMATE.start_fifo_empty_~self.base)) (= ULTIMATE.start_fifo_empty_~self.offset 0) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|)), 158163#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base)), 158161#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|)))] [2020-10-22 00:54:57,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-22 00:54:57,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:54:57,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-22 00:54:57,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2020-10-22 00:54:57,892 INFO L87 Difference]: Start difference. First operand 3992 states and 9338 transitions. Second operand 17 states. [2020-10-22 00:54:59,810 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2020-10-22 00:55:00,396 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2020-10-22 00:55:00,550 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2020-10-22 00:55:01,094 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 71 [2020-10-22 00:55:02,014 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2020-10-22 00:55:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:04,379 INFO L93 Difference]: Finished difference Result 6156 states and 13880 transitions. [2020-10-22 00:55:04,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-22 00:55:04,380 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 21 [2020-10-22 00:55:04,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:04,388 INFO L225 Difference]: With dead ends: 6156 [2020-10-22 00:55:04,389 INFO L226 Difference]: Without dead ends: 6129 [2020-10-22 00:55:04,389 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=550, Invalid=1342, Unknown=0, NotChecked=0, Total=1892 [2020-10-22 00:55:04,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6129 states. [2020-10-22 00:55:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6129 to 4050. [2020-10-22 00:55:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4050 states. [2020-10-22 00:55:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 9471 transitions. [2020-10-22 00:55:04,460 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 9471 transitions. Word has length 21 [2020-10-22 00:55:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:04,460 INFO L481 AbstractCegarLoop]: Abstraction has 4050 states and 9471 transitions. [2020-10-22 00:55:04,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-22 00:55:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 9471 transitions. [2020-10-22 00:55:04,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-22 00:55:04,463 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:04,463 INFO L422 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] [2020-10-22 00:55:04,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-22 00:55:04,463 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:55:04,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:04,464 INFO L82 PathProgramCache]: Analyzing trace with hash -639522947, now seen corresponding path program 1 times [2020-10-22 00:55:04,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:04,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031351767] [2020-10-22 00:55:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:55:04,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031351767] [2020-10-22 00:55:04,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:55:04,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-22 00:55:04,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546837455] [2020-10-22 00:55:04,909 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:55:04,912 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:55:04,921 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 52 transitions. [2020-10-22 00:55:04,921 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:55:04,927 INFO L603 QuantifierPusher]: Distributing 6 disjuncts over 4 conjuncts [2020-10-22 00:55:04,970 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:55:04,971 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:04,977 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:55:04,978 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:04,983 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:55:04,984 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:04,990 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:55:04,991 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:04,996 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:55:04,997 INFO L545 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:05,003 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2020-10-22 00:55:05,005 INFO L545 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:05,054 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:55:05,059 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2020-10-22 00:55:05,059 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:107, output treesize:31 [2020-10-22 00:55:05,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:55:05,234 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:55:05,234 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:05,238 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-10-22 00:55:05,238 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-22 00:55:05,243 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-22 00:55:05,243 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-22 00:55:05,243 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:9 [2020-10-22 00:55:05,580 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [172490#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (not (= |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| |ULTIMATE.start_main_~#q~1.base|))), 172491#(and (= |ULTIMATE.start_main_~#q~1.offset| 0) (= pusherThread1of1ForFork0_~q~0.base |ULTIMATE.start_main_~#q~1.base|) (<= (+ |#StackHeapBarrier| 1) pusherThread1of1ForFork0_~q~0.base)), 172489#(and (= |ULTIMATE.start_fifo_empty_#t~mem6.base| (select (select |#memory_$Pointer$.base| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset)) (= ULTIMATE.start_fifo_front_~self.offset 0) (= ULTIMATE.start_fifo_empty_~self.base ULTIMATE.start_fifo_front_~self.base) (or (= ULTIMATE.start_fifo_empty_~self.base 0) (<= |#StackHeapBarrier| ULTIMATE.start_fifo_empty_~self.base)) (= ULTIMATE.start_fifo_empty_~self.offset 0) (= (select (select |#memory_$Pointer$.offset| ULTIMATE.start_fifo_empty_~self.base) ULTIMATE.start_fifo_empty_~self.offset) |ULTIMATE.start_fifo_empty_#t~mem6.offset|))] [2020-10-22 00:55:05,581 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-22 00:55:05,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:55:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-22 00:55:05,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-10-22 00:55:05,582 INFO L87 Difference]: Start difference. First operand 4050 states and 9471 transitions. Second operand 18 states. [2020-10-22 00:55:08,081 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2020-10-22 00:55:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:55:11,534 INFO L93 Difference]: Finished difference Result 6037 states and 13620 transitions. [2020-10-22 00:55:11,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-22 00:55:11,535 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 22 [2020-10-22 00:55:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:55:11,542 INFO L225 Difference]: With dead ends: 6037 [2020-10-22 00:55:11,543 INFO L226 Difference]: Without dead ends: 6017 [2020-10-22 00:55:11,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=433, Invalid=1207, Unknown=0, NotChecked=0, Total=1640 [2020-10-22 00:55:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6017 states. [2020-10-22 00:55:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6017 to 2713. [2020-10-22 00:55:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2020-10-22 00:55:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 6192 transitions. [2020-10-22 00:55:11,604 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 6192 transitions. Word has length 22 [2020-10-22 00:55:11,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:55:11,604 INFO L481 AbstractCegarLoop]: Abstraction has 2713 states and 6192 transitions. [2020-10-22 00:55:11,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-22 00:55:11,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 6192 transitions. [2020-10-22 00:55:11,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-22 00:55:11,606 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:55:11,607 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:55:11,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-22 00:55:11,607 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:55:11,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:55:11,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1471324778, now seen corresponding path program 1 times [2020-10-22 00:55:11,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:55:11,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354600379] [2020-10-22 00:55:11,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:55:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:55:11,667 ERROR L253 erpolLogProxyWrapper]: Interpolant 12 not inductive [2020-10-22 00:55:11,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-22 00:55:11,674 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) 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:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) 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:360) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-10-22 00:55:11,678 INFO L168 Benchmark]: Toolchain (without parser) took 239206.03 ms. Allocated memory was 140.0 MB in the beginning and 431.5 MB in the end (delta: 291.5 MB). Free memory was 100.9 MB in the beginning and 212.8 MB in the end (delta: -111.9 MB). Peak memory consumption was 179.6 MB. Max. memory is 7.1 GB. [2020-10-22 00:55:11,679 INFO L168 Benchmark]: CDTParser took 3.08 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:55:11,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 980.39 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 128.8 MB in the end (delta: -29.0 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:55:11,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.66 ms. Allocated memory is still 203.9 MB. Free memory was 128.8 MB in the beginning and 124.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:55:11,680 INFO L168 Benchmark]: Boogie Preprocessor took 99.14 ms. Allocated memory is still 203.9 MB. Free memory was 124.0 MB in the beginning and 119.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:55:11,680 INFO L168 Benchmark]: RCFGBuilder took 1056.04 ms. Allocated memory was 203.9 MB in the beginning and 236.5 MB in the end (delta: 32.5 MB). Free memory was 119.9 MB in the beginning and 143.9 MB in the end (delta: -24.0 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:55:11,681 INFO L168 Benchmark]: TraceAbstraction took 236957.07 ms. Allocated memory was 236.5 MB in the beginning and 431.5 MB in the end (delta: 195.0 MB). Free memory was 143.9 MB in the beginning and 212.8 MB in the end (delta: -68.8 MB). Peak memory consumption was 126.2 MB. Max. memory is 7.1 GB. [2020-10-22 00:55:11,683 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 3.08 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 980.39 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 99.9 MB in the beginning and 128.8 MB in the end (delta: -29.0 MB). Peak memory consumption was 40.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 102.66 ms. Allocated memory is still 203.9 MB. Free memory was 128.8 MB in the beginning and 124.0 MB in the end (delta: 4.8 MB). Peak memory consumption was 4.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 99.14 ms. Allocated memory is still 203.9 MB. Free memory was 124.0 MB in the beginning and 119.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1056.04 ms. Allocated memory was 203.9 MB in the beginning and 236.5 MB in the end (delta: 32.5 MB). Free memory was 119.9 MB in the beginning and 143.9 MB in the end (delta: -24.0 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 236957.07 ms. Allocated memory was 236.5 MB in the beginning and 431.5 MB in the end (delta: 195.0 MB). Free memory was 143.9 MB in the beginning and 212.8 MB in the end (delta: -68.8 MB). Peak memory consumption was 126.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 18420 VarBasedMoverChecksPositive, 257 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 745 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 19.9s, 459 PlacesBefore, 109 PlacesAfterwards, 498 TransitionsBefore, 126 TransitionsAfterwards, 34102 CoEnabledTransitionPairs, 7 FixpointIterations, 155 TrivialSequentialCompositions, 261 ConcurrentSequentialCompositions, 31 TrivialYvCompositions, 70 ConcurrentYvCompositions, 22 ChoiceCompositions, 539 TotalNumberOfCompositions, 79858 MoverChecksTotal - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...