/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:20:13,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:20:13,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:20:13,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:20:13,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:20:13,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:20:13,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:20:13,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:20:13,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:20:13,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:20:13,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:20:13,622 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:20:13,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:20:13,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:20:13,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:20:13,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:20:13,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:20:13,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:20:13,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:20:13,631 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:20:13,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:20:13,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:20:13,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:20:13,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:20:13,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:20:13,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:20:13,638 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:20:13,639 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:20:13,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:20:13,640 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:20:13,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:20:13,641 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:20:13,642 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:20:13,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:20:13,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:20:13,644 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:20:13,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:20:13,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:20:13,645 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:20:13,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:20:13,647 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:20:13,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:20:13,671 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:20:13,671 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:20:13,672 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:20:13,672 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:20:13,673 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:20:13,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:20:13,673 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:20:13,673 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:20:13,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:20:13,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:20:13,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:20:13,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:20:13,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:20:13,675 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:20:13,675 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:20:13,675 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:20:13,675 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:20:13,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:20:13,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:20:13,676 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:20:13,676 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:20:13,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:20:13,676 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:20:13,676 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:20:13,677 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:20:13,677 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:20:13,677 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:20:13,677 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:20:13,677 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:20:13,677 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:20:13,678 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:20:13,678 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:20:13,937 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:20:13,948 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:20:13,953 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:20:13,955 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:20:13,955 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:20:13,956 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2019-12-27 22:20:14,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5ea5077/6ef08574e7ea42ca928129d42de5c8c6/FLAG601c6828c [2019-12-27 22:20:14,561 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:20:14,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_pso.opt.i [2019-12-27 22:20:14,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5ea5077/6ef08574e7ea42ca928129d42de5c8c6/FLAG601c6828c [2019-12-27 22:20:14,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc5ea5077/6ef08574e7ea42ca928129d42de5c8c6 [2019-12-27 22:20:14,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:20:14,929 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:20:14,929 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:14,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:20:14,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:20:14,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc3f7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:14, skipping insertion in model container [2019-12-27 22:20:14,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:20:14" (1/1) ... [2019-12-27 22:20:14,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:20:15,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:20:15,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:15,558 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:20:15,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:20:15,700 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:20:15,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15 WrapperNode [2019-12-27 22:20:15,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:20:15,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:15,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:20:15,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:20:15,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,785 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:20:15,786 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:20:15,786 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:20:15,786 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:20:15,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (1/1) ... [2019-12-27 22:20:15,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:20:15,834 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:20:15,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:20:15,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:20:15,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (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 [2019-12-27 22:20:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:20:15,894 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:20:15,894 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:20:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:20:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:20:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:20:15,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:20:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:20:15,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:20:15,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:20:15,898 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:20:16,679 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:20:16,680 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:20:16,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:16 BoogieIcfgContainer [2019-12-27 22:20:16,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:20:16,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:20:16,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:20:16,687 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:20:16,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:20:14" (1/3) ... [2019-12-27 22:20:16,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643dc2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:16, skipping insertion in model container [2019-12-27 22:20:16,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:20:15" (2/3) ... [2019-12-27 22:20:16,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@643dc2c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:20:16, skipping insertion in model container [2019-12-27 22:20:16,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:20:16" (3/3) ... [2019-12-27 22:20:16,692 INFO L109 eAbstractionObserver]: Analyzing ICFG safe008_pso.opt.i [2019-12-27 22:20:16,703 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:20:16,704 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:20:16,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:20:16,717 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:20:16,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,756 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,761 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,762 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,763 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,764 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,765 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,768 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,769 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,779 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,780 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,780 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,782 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,783 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,784 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,785 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,786 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,787 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,808 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,811 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,812 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,815 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,815 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,833 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:20:16,850 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:20:16,871 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:20:16,871 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:20:16,871 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:20:16,871 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:20:16,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:20:16,872 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:20:16,872 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:20:16,872 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:20:16,890 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-27 22:20:16,892 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:17,027 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:17,027 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:17,042 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:17,062 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-27 22:20:17,127 INFO L132 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-27 22:20:17,127 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:20:17,135 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 342 event pairs. 0/160 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 22:20:17,154 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 22:20:17,155 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:20:20,540 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 22:20:20,662 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 22:20:20,691 INFO L206 etLargeBlockEncoding]: Checked pairs total: 84694 [2019-12-27 22:20:20,692 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 22:20:20,695 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 111 transitions [2019-12-27 22:20:43,984 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129812 states. [2019-12-27 22:20:43,986 INFO L276 IsEmpty]: Start isEmpty. Operand 129812 states. [2019-12-27 22:20:43,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 22:20:43,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:20:43,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 22:20:43,993 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:20:43,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:20:43,998 INFO L82 PathProgramCache]: Analyzing trace with hash 841641, now seen corresponding path program 1 times [2019-12-27 22:20:44,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:20:44,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499244408] [2019-12-27 22:20:44,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:20:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:20:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:20:44,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499244408] [2019-12-27 22:20:44,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:20:44,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:20:44,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [529827805] [2019-12-27 22:20:44,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:20:44,273 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:20:44,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 22:20:44,290 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:20:44,296 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:20:44,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:20:44,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:20:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:20:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:20:44,320 INFO L87 Difference]: Start difference. First operand 129812 states. Second operand 3 states. [2019-12-27 22:20:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:20:45,840 INFO L93 Difference]: Finished difference Result 129324 states and 557563 transitions. [2019-12-27 22:20:45,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:20:45,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 22:20:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:20:46,880 INFO L225 Difference]: With dead ends: 129324 [2019-12-27 22:20:46,881 INFO L226 Difference]: Without dead ends: 126776 [2019-12-27 22:20:46,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:20:54,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126776 states. [2019-12-27 22:21:00,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126776 to 126776. [2019-12-27 22:21:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126776 states. [2019-12-27 22:21:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126776 states to 126776 states and 547175 transitions. [2019-12-27 22:21:00,675 INFO L78 Accepts]: Start accepts. Automaton has 126776 states and 547175 transitions. Word has length 3 [2019-12-27 22:21:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:00,676 INFO L462 AbstractCegarLoop]: Abstraction has 126776 states and 547175 transitions. [2019-12-27 22:21:00,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 126776 states and 547175 transitions. [2019-12-27 22:21:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 22:21:00,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:00,687 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:00,688 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1225155789, now seen corresponding path program 1 times [2019-12-27 22:21:00,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:00,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357572552] [2019-12-27 22:21:00,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:00,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:00,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357572552] [2019-12-27 22:21:00,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:00,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:00,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1357547999] [2019-12-27 22:21:00,813 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:00,815 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:00,819 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 22:21:00,819 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:00,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:00,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:00,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:00,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:00,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:00,822 INFO L87 Difference]: Start difference. First operand 126776 states and 547175 transitions. Second operand 4 states. [2019-12-27 22:21:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:06,922 INFO L93 Difference]: Finished difference Result 198216 states and 822018 transitions. [2019-12-27 22:21:06,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:06,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 22:21:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:07,581 INFO L225 Difference]: With dead ends: 198216 [2019-12-27 22:21:07,581 INFO L226 Difference]: Without dead ends: 198167 [2019-12-27 22:21:07,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:13,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198167 states. [2019-12-27 22:21:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198167 to 182118. [2019-12-27 22:21:18,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182118 states. [2019-12-27 22:21:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182118 states to 182118 states and 765134 transitions. [2019-12-27 22:21:18,716 INFO L78 Accepts]: Start accepts. Automaton has 182118 states and 765134 transitions. Word has length 11 [2019-12-27 22:21:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:18,717 INFO L462 AbstractCegarLoop]: Abstraction has 182118 states and 765134 transitions. [2019-12-27 22:21:18,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 182118 states and 765134 transitions. [2019-12-27 22:21:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:21:18,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:18,722 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:18,722 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1435968535, now seen corresponding path program 1 times [2019-12-27 22:21:18,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:18,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770721257] [2019-12-27 22:21:18,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:18,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770721257] [2019-12-27 22:21:18,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:18,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:18,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [718479201] [2019-12-27 22:21:18,829 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:18,830 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:18,833 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:21:18,833 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:18,833 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:18,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:18,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:18,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:18,834 INFO L87 Difference]: Start difference. First operand 182118 states and 765134 transitions. Second operand 4 states. [2019-12-27 22:21:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:27,362 INFO L93 Difference]: Finished difference Result 260296 states and 1067327 transitions. [2019-12-27 22:21:27,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:27,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:21:27,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:28,203 INFO L225 Difference]: With dead ends: 260296 [2019-12-27 22:21:28,203 INFO L226 Difference]: Without dead ends: 260233 [2019-12-27 22:21:28,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260233 states. [2019-12-27 22:21:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260233 to 221154. [2019-12-27 22:21:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221154 states. [2019-12-27 22:21:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221154 states to 221154 states and 922215 transitions. [2019-12-27 22:21:47,623 INFO L78 Accepts]: Start accepts. Automaton has 221154 states and 922215 transitions. Word has length 13 [2019-12-27 22:21:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:47,624 INFO L462 AbstractCegarLoop]: Abstraction has 221154 states and 922215 transitions. [2019-12-27 22:21:47,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 221154 states and 922215 transitions. [2019-12-27 22:21:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:21:47,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:47,628 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:47,628 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:47,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:47,628 INFO L82 PathProgramCache]: Analyzing trace with hash 472638345, now seen corresponding path program 1 times [2019-12-27 22:21:47,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:47,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285844056] [2019-12-27 22:21:47,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:47,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285844056] [2019-12-27 22:21:47,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:47,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:47,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1400620054] [2019-12-27 22:21:47,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:47,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:47,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:21:47,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:47,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:47,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:47,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:47,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:47,716 INFO L87 Difference]: Start difference. First operand 221154 states and 922215 transitions. Second operand 3 states. [2019-12-27 22:21:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:47,879 INFO L93 Difference]: Finished difference Result 42754 states and 139696 transitions. [2019-12-27 22:21:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 22:21:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:47,954 INFO L225 Difference]: With dead ends: 42754 [2019-12-27 22:21:47,955 INFO L226 Difference]: Without dead ends: 42754 [2019-12-27 22:21:47,955 INFO L631 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 [2019-12-27 22:21:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42754 states. [2019-12-27 22:21:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42754 to 42754. [2019-12-27 22:21:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42754 states. [2019-12-27 22:21:48,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42754 states to 42754 states and 139696 transitions. [2019-12-27 22:21:48,710 INFO L78 Accepts]: Start accepts. Automaton has 42754 states and 139696 transitions. Word has length 13 [2019-12-27 22:21:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:48,710 INFO L462 AbstractCegarLoop]: Abstraction has 42754 states and 139696 transitions. [2019-12-27 22:21:48,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:48,710 INFO L276 IsEmpty]: Start isEmpty. Operand 42754 states and 139696 transitions. [2019-12-27 22:21:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:21:48,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:48,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:48,716 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:48,716 INFO L82 PathProgramCache]: Analyzing trace with hash -589628414, now seen corresponding path program 1 times [2019-12-27 22:21:48,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:48,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588563042] [2019-12-27 22:21:48,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:48,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:48,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588563042] [2019-12-27 22:21:48,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:48,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:48,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1983978159] [2019-12-27 22:21:48,838 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:48,841 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:48,845 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 37 transitions. [2019-12-27 22:21:48,845 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:48,847 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:48,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:48,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:48,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:48,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:48,848 INFO L87 Difference]: Start difference. First operand 42754 states and 139696 transitions. Second operand 5 states. [2019-12-27 22:21:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:49,770 INFO L93 Difference]: Finished difference Result 57358 states and 183378 transitions. [2019-12-27 22:21:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:21:49,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:21:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:51,014 INFO L225 Difference]: With dead ends: 57358 [2019-12-27 22:21:51,014 INFO L226 Difference]: Without dead ends: 57345 [2019-12-27 22:21:51,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:21:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57345 states. [2019-12-27 22:21:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57345 to 43244. [2019-12-27 22:21:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43244 states. [2019-12-27 22:21:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43244 states to 43244 states and 140907 transitions. [2019-12-27 22:21:51,813 INFO L78 Accepts]: Start accepts. Automaton has 43244 states and 140907 transitions. Word has length 19 [2019-12-27 22:21:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:51,813 INFO L462 AbstractCegarLoop]: Abstraction has 43244 states and 140907 transitions. [2019-12-27 22:21:51,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 43244 states and 140907 transitions. [2019-12-27 22:21:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 22:21:51,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:51,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:51,825 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1356407650, now seen corresponding path program 1 times [2019-12-27 22:21:51,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:51,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517192864] [2019-12-27 22:21:51,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:51,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:51,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517192864] [2019-12-27 22:21:51,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:51,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:51,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729699044] [2019-12-27 22:21:51,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:51,905 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:51,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 22:21:51,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:51,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:51,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:21:51,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:51,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:21:51,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:51,911 INFO L87 Difference]: Start difference. First operand 43244 states and 140907 transitions. Second operand 4 states. [2019-12-27 22:21:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:51,952 INFO L93 Difference]: Finished difference Result 8037 states and 21818 transitions. [2019-12-27 22:21:51,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:21:51,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 22:21:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:51,962 INFO L225 Difference]: With dead ends: 8037 [2019-12-27 22:21:51,962 INFO L226 Difference]: Without dead ends: 8037 [2019-12-27 22:21:51,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:21:51,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8037 states. [2019-12-27 22:21:52,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8037 to 7897. [2019-12-27 22:21:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 22:21:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 21446 transitions. [2019-12-27 22:21:52,062 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 21446 transitions. Word has length 25 [2019-12-27 22:21:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:52,062 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 21446 transitions. [2019-12-27 22:21:52,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:21:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 21446 transitions. [2019-12-27 22:21:52,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 22:21:52,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:52,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:52,074 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:52,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:52,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1453764539, now seen corresponding path program 1 times [2019-12-27 22:21:52,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:52,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867221003] [2019-12-27 22:21:52,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:52,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867221003] [2019-12-27 22:21:52,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:52,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:21:52,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [580069615] [2019-12-27 22:21:52,155 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:52,161 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:52,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 92 transitions. [2019-12-27 22:21:52,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:52,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:21:52,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:52,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:52,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:52,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:52,191 INFO L87 Difference]: Start difference. First operand 7897 states and 21446 transitions. Second operand 5 states. [2019-12-27 22:21:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:52,241 INFO L93 Difference]: Finished difference Result 5718 states and 16246 transitions. [2019-12-27 22:21:52,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:21:52,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 22:21:52,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:52,249 INFO L225 Difference]: With dead ends: 5718 [2019-12-27 22:21:52,250 INFO L226 Difference]: Without dead ends: 5314 [2019-12-27 22:21:52,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2019-12-27 22:21:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4950. [2019-12-27 22:21:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4950 states. [2019-12-27 22:21:52,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4950 states to 4950 states and 14287 transitions. [2019-12-27 22:21:52,340 INFO L78 Accepts]: Start accepts. Automaton has 4950 states and 14287 transitions. Word has length 37 [2019-12-27 22:21:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:52,341 INFO L462 AbstractCegarLoop]: Abstraction has 4950 states and 14287 transitions. [2019-12-27 22:21:52,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4950 states and 14287 transitions. [2019-12-27 22:21:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:52,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:52,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:52,349 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:52,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:52,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1228802019, now seen corresponding path program 1 times [2019-12-27 22:21:52,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:52,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823336564] [2019-12-27 22:21:52,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:52,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823336564] [2019-12-27 22:21:52,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:52,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:21:52,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556577200] [2019-12-27 22:21:52,442 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:52,463 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:54,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:21:54,479 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:54,480 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:54,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:54,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:54,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:54,481 INFO L87 Difference]: Start difference. First operand 4950 states and 14287 transitions. Second operand 3 states. [2019-12-27 22:21:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:54,546 INFO L93 Difference]: Finished difference Result 4959 states and 14296 transitions. [2019-12-27 22:21:54,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:54,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:21:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:54,554 INFO L225 Difference]: With dead ends: 4959 [2019-12-27 22:21:54,555 INFO L226 Difference]: Without dead ends: 4959 [2019-12-27 22:21:54,555 INFO L631 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 [2019-12-27 22:21:54,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2019-12-27 22:21:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 4955. [2019-12-27 22:21:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4955 states. [2019-12-27 22:21:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4955 states to 4955 states and 14292 transitions. [2019-12-27 22:21:54,651 INFO L78 Accepts]: Start accepts. Automaton has 4955 states and 14292 transitions. Word has length 65 [2019-12-27 22:21:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:54,652 INFO L462 AbstractCegarLoop]: Abstraction has 4955 states and 14292 transitions. [2019-12-27 22:21:54,652 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:21:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 4955 states and 14292 transitions. [2019-12-27 22:21:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:54,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:54,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:54,662 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:54,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:54,662 INFO L82 PathProgramCache]: Analyzing trace with hash 320653868, now seen corresponding path program 1 times [2019-12-27 22:21:54,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:54,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283262725] [2019-12-27 22:21:54,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:54,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:54,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283262725] [2019-12-27 22:21:54,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:54,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:21:54,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063710221] [2019-12-27 22:21:54,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:54,805 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:54,953 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 222 states and 403 transitions. [2019-12-27 22:21:54,953 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:55,151 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:21:55,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:21:55,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:55,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:21:55,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:21:55,152 INFO L87 Difference]: Start difference. First operand 4955 states and 14292 transitions. Second operand 10 states. [2019-12-27 22:21:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:55,741 INFO L93 Difference]: Finished difference Result 7546 states and 21557 transitions. [2019-12-27 22:21:55,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:21:55,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 22:21:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:55,752 INFO L225 Difference]: With dead ends: 7546 [2019-12-27 22:21:55,753 INFO L226 Difference]: Without dead ends: 7546 [2019-12-27 22:21:55,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:21:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7546 states. [2019-12-27 22:21:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7546 to 6352. [2019-12-27 22:21:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6352 states. [2019-12-27 22:21:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6352 states to 6352 states and 18327 transitions. [2019-12-27 22:21:55,840 INFO L78 Accepts]: Start accepts. Automaton has 6352 states and 18327 transitions. Word has length 65 [2019-12-27 22:21:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:55,841 INFO L462 AbstractCegarLoop]: Abstraction has 6352 states and 18327 transitions. [2019-12-27 22:21:55,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:21:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 6352 states and 18327 transitions. [2019-12-27 22:21:55,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:55,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:55,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:55,852 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:55,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:55,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2108512596, now seen corresponding path program 2 times [2019-12-27 22:21:55,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:55,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419277796] [2019-12-27 22:21:55,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:55,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419277796] [2019-12-27 22:21:55,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:55,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:21:55,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [181950445] [2019-12-27 22:21:55,961 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:55,981 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:56,108 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 198 states and 357 transitions. [2019-12-27 22:21:56,109 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:56,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:21:56,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:21:56,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:56,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:21:56,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:21:56,128 INFO L87 Difference]: Start difference. First operand 6352 states and 18327 transitions. Second operand 5 states. [2019-12-27 22:21:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:56,493 INFO L93 Difference]: Finished difference Result 9350 states and 26643 transitions. [2019-12-27 22:21:56,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:21:56,494 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 22:21:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:56,507 INFO L225 Difference]: With dead ends: 9350 [2019-12-27 22:21:56,507 INFO L226 Difference]: Without dead ends: 9350 [2019-12-27 22:21:56,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:21:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9350 states. [2019-12-27 22:21:56,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9350 to 7014. [2019-12-27 22:21:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7014 states. [2019-12-27 22:21:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7014 states to 7014 states and 20305 transitions. [2019-12-27 22:21:56,617 INFO L78 Accepts]: Start accepts. Automaton has 7014 states and 20305 transitions. Word has length 65 [2019-12-27 22:21:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:56,618 INFO L462 AbstractCegarLoop]: Abstraction has 7014 states and 20305 transitions. [2019-12-27 22:21:56,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:21:56,618 INFO L276 IsEmpty]: Start isEmpty. Operand 7014 states and 20305 transitions. [2019-12-27 22:21:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:56,678 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:56,678 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:56,678 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:56,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:56,679 INFO L82 PathProgramCache]: Analyzing trace with hash 27480750, now seen corresponding path program 3 times [2019-12-27 22:21:56,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:56,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671793942] [2019-12-27 22:21:56,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:56,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671793942] [2019-12-27 22:21:56,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:56,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:21:56,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [996801602] [2019-12-27 22:21:56,775 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:56,797 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:56,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 184 states and 310 transitions. [2019-12-27 22:21:56,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:57,048 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:21:57,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:21:57,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:57,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:21:57,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:21:57,050 INFO L87 Difference]: Start difference. First operand 7014 states and 20305 transitions. Second operand 11 states. [2019-12-27 22:21:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:59,197 INFO L93 Difference]: Finished difference Result 17056 states and 48283 transitions. [2019-12-27 22:21:59,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 22:21:59,197 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 22:21:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:59,218 INFO L225 Difference]: With dead ends: 17056 [2019-12-27 22:21:59,218 INFO L226 Difference]: Without dead ends: 17056 [2019-12-27 22:21:59,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-12-27 22:21:59,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17056 states. [2019-12-27 22:21:59,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17056 to 7595. [2019-12-27 22:21:59,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7595 states. [2019-12-27 22:21:59,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7595 states to 7595 states and 22075 transitions. [2019-12-27 22:21:59,385 INFO L78 Accepts]: Start accepts. Automaton has 7595 states and 22075 transitions. Word has length 65 [2019-12-27 22:21:59,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:21:59,385 INFO L462 AbstractCegarLoop]: Abstraction has 7595 states and 22075 transitions. [2019-12-27 22:21:59,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:21:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 7595 states and 22075 transitions. [2019-12-27 22:21:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 22:21:59,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:21:59,396 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:21:59,396 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:21:59,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:21:59,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1465472054, now seen corresponding path program 4 times [2019-12-27 22:21:59,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:21:59,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654108882] [2019-12-27 22:21:59,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:21:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:21:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:21:59,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654108882] [2019-12-27 22:21:59,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:21:59,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:21:59,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [252845283] [2019-12-27 22:21:59,520 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:21:59,557 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:21:59,754 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 211 states and 385 transitions. [2019-12-27 22:21:59,755 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:21:59,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:21:59,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:21:59,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:21:59,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:21:59,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:59,758 INFO L87 Difference]: Start difference. First operand 7595 states and 22075 transitions. Second operand 3 states. [2019-12-27 22:21:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:21:59,844 INFO L93 Difference]: Finished difference Result 7594 states and 22073 transitions. [2019-12-27 22:21:59,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:21:59,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 22:21:59,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:21:59,857 INFO L225 Difference]: With dead ends: 7594 [2019-12-27 22:21:59,858 INFO L226 Difference]: Without dead ends: 7594 [2019-12-27 22:21:59,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:21:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7594 states. [2019-12-27 22:22:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7594 to 4867. [2019-12-27 22:22:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2019-12-27 22:22:00,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 14413 transitions. [2019-12-27 22:22:00,065 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 14413 transitions. Word has length 65 [2019-12-27 22:22:00,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:00,066 INFO L462 AbstractCegarLoop]: Abstraction has 4867 states and 14413 transitions. [2019-12-27 22:22:00,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:22:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 14413 transitions. [2019-12-27 22:22:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:22:00,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:00,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:00,076 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:00,077 INFO L82 PathProgramCache]: Analyzing trace with hash -337801162, now seen corresponding path program 1 times [2019-12-27 22:22:00,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:00,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950217751] [2019-12-27 22:22:00,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:00,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:00,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950217751] [2019-12-27 22:22:00,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:00,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 22:22:00,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1659647862] [2019-12-27 22:22:00,247 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:00,264 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:00,375 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 199 states and 358 transitions. [2019-12-27 22:22:00,376 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:00,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:00,521 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 22:22:00,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 22:22:00,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:00,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 22:22:00,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:22:00,522 INFO L87 Difference]: Start difference. First operand 4867 states and 14413 transitions. Second operand 11 states. [2019-12-27 22:22:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:01,794 INFO L93 Difference]: Finished difference Result 7942 states and 22932 transitions. [2019-12-27 22:22:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:22:01,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-27 22:22:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:01,805 INFO L225 Difference]: With dead ends: 7942 [2019-12-27 22:22:01,806 INFO L226 Difference]: Without dead ends: 7942 [2019-12-27 22:22:01,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2019-12-27 22:22:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7942 states. [2019-12-27 22:22:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7942 to 4867. [2019-12-27 22:22:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4867 states. [2019-12-27 22:22:01,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 14413 transitions. [2019-12-27 22:22:01,893 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 14413 transitions. Word has length 66 [2019-12-27 22:22:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:01,894 INFO L462 AbstractCegarLoop]: Abstraction has 4867 states and 14413 transitions. [2019-12-27 22:22:01,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 22:22:01,894 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 14413 transitions. [2019-12-27 22:22:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 22:22:01,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:01,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:01,901 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:01,901 INFO L82 PathProgramCache]: Analyzing trace with hash 891199558, now seen corresponding path program 2 times [2019-12-27 22:22:01,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:01,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355028042] [2019-12-27 22:22:01,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:01,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355028042] [2019-12-27 22:22:01,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:01,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:01,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [119368625] [2019-12-27 22:22:01,975 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:01,998 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:02,192 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 207 states and 369 transitions. [2019-12-27 22:22:02,193 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:02,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:22:02,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:22:02,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:02,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:22:02,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:22:02,217 INFO L87 Difference]: Start difference. First operand 4867 states and 14413 transitions. Second operand 5 states. [2019-12-27 22:22:02,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:02,446 INFO L93 Difference]: Finished difference Result 5900 states and 16829 transitions. [2019-12-27 22:22:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:02,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 22:22:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:02,456 INFO L225 Difference]: With dead ends: 5900 [2019-12-27 22:22:02,456 INFO L226 Difference]: Without dead ends: 5900 [2019-12-27 22:22:02,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:02,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5900 states. [2019-12-27 22:22:02,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5900 to 3739. [2019-12-27 22:22:02,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2019-12-27 22:22:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 10867 transitions. [2019-12-27 22:22:02,553 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 10867 transitions. Word has length 66 [2019-12-27 22:22:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:02,553 INFO L462 AbstractCegarLoop]: Abstraction has 3739 states and 10867 transitions. [2019-12-27 22:22:02,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:22:02,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 10867 transitions. [2019-12-27 22:22:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 22:22:02,561 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:02,562 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:02,562 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1909324032, now seen corresponding path program 1 times [2019-12-27 22:22:02,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:02,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361951686] [2019-12-27 22:22:02,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:02,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361951686] [2019-12-27 22:22:02,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:02,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:22:02,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [701726762] [2019-12-27 22:22:02,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:02,663 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:02,827 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 219 states and 400 transitions. [2019-12-27 22:22:02,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:02,870 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:22:02,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:22:02,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:02,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:22:02,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:22:02,871 INFO L87 Difference]: Start difference. First operand 3739 states and 10867 transitions. Second operand 6 states. [2019-12-27 22:22:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:03,032 INFO L93 Difference]: Finished difference Result 4613 states and 12870 transitions. [2019-12-27 22:22:03,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:22:03,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 22:22:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:03,040 INFO L225 Difference]: With dead ends: 4613 [2019-12-27 22:22:03,040 INFO L226 Difference]: Without dead ends: 4613 [2019-12-27 22:22:03,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:22:03,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4613 states. [2019-12-27 22:22:03,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4613 to 2989. [2019-12-27 22:22:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2989 states. [2019-12-27 22:22:03,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2989 states to 2989 states and 8460 transitions. [2019-12-27 22:22:03,090 INFO L78 Accepts]: Start accepts. Automaton has 2989 states and 8460 transitions. Word has length 67 [2019-12-27 22:22:03,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:03,090 INFO L462 AbstractCegarLoop]: Abstraction has 2989 states and 8460 transitions. [2019-12-27 22:22:03,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:22:03,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2989 states and 8460 transitions. [2019-12-27 22:22:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:03,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:03,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:03,095 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash -620246542, now seen corresponding path program 1 times [2019-12-27 22:22:03,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:03,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43638713] [2019-12-27 22:22:03,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:03,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:03,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43638713] [2019-12-27 22:22:03,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:03,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:22:03,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [522496636] [2019-12-27 22:22:03,207 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:03,230 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:03,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 245 states and 460 transitions. [2019-12-27 22:22:03,398 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:03,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 22:22:03,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:22:03,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:03,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:22:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:22:03,422 INFO L87 Difference]: Start difference. First operand 2989 states and 8460 transitions. Second operand 6 states. [2019-12-27 22:22:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:03,487 INFO L93 Difference]: Finished difference Result 5222 states and 14740 transitions. [2019-12-27 22:22:03,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:22:03,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 22:22:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:03,493 INFO L225 Difference]: With dead ends: 5222 [2019-12-27 22:22:03,493 INFO L226 Difference]: Without dead ends: 2817 [2019-12-27 22:22:03,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:22:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2817 states. [2019-12-27 22:22:03,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2817 to 2817. [2019-12-27 22:22:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2817 states. [2019-12-27 22:22:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2817 states to 2817 states and 7945 transitions. [2019-12-27 22:22:03,533 INFO L78 Accepts]: Start accepts. Automaton has 2817 states and 7945 transitions. Word has length 68 [2019-12-27 22:22:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:03,533 INFO L462 AbstractCegarLoop]: Abstraction has 2817 states and 7945 transitions. [2019-12-27 22:22:03,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:22:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2817 states and 7945 transitions. [2019-12-27 22:22:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:03,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:03,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:03,536 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:03,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1307128750, now seen corresponding path program 2 times [2019-12-27 22:22:03,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:03,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677554107] [2019-12-27 22:22:03,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:03,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:03,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677554107] [2019-12-27 22:22:03,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:03,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:22:03,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1017588637] [2019-12-27 22:22:03,883 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:03,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:04,223 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 538 transitions. [2019-12-27 22:22:04,223 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:04,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:04,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:04,741 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 22:22:04,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:22:04,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:22:04,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:22:04,742 INFO L87 Difference]: Start difference. First operand 2817 states and 7945 transitions. Second operand 20 states. [2019-12-27 22:22:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:05,760 INFO L93 Difference]: Finished difference Result 5574 states and 15703 transitions. [2019-12-27 22:22:05,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 22:22:05,761 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 22:22:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:05,769 INFO L225 Difference]: With dead ends: 5574 [2019-12-27 22:22:05,769 INFO L226 Difference]: Without dead ends: 5542 [2019-12-27 22:22:05,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 13 SyntacticMatches, 16 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=210, Invalid=912, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:22:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5542 states. [2019-12-27 22:22:05,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5542 to 3948. [2019-12-27 22:22:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-27 22:22:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 11039 transitions. [2019-12-27 22:22:05,835 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 11039 transitions. Word has length 68 [2019-12-27 22:22:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:05,835 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 11039 transitions. [2019-12-27 22:22:05,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:22:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 11039 transitions. [2019-12-27 22:22:05,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:05,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:05,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:05,839 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:05,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1086450056, now seen corresponding path program 3 times [2019-12-27 22:22:05,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:05,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291314136] [2019-12-27 22:22:05,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:06,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:06,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291314136] [2019-12-27 22:22:06,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:06,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 22:22:06,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1627025917] [2019-12-27 22:22:06,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:06,218 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:06,506 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 522 transitions. [2019-12-27 22:22:06,506 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:07,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:07,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:07,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 28 times. [2019-12-27 22:22:07,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 22:22:07,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:07,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 22:22:07,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-27 22:22:07,207 INFO L87 Difference]: Start difference. First operand 3948 states and 11039 transitions. Second operand 20 states. [2019-12-27 22:22:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:08,577 INFO L93 Difference]: Finished difference Result 7082 states and 19912 transitions. [2019-12-27 22:22:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:22:08,577 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 68 [2019-12-27 22:22:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:08,587 INFO L225 Difference]: With dead ends: 7082 [2019-12-27 22:22:08,587 INFO L226 Difference]: Without dead ends: 7050 [2019-12-27 22:22:08,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 9 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:22:08,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-27 22:22:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 4160. [2019-12-27 22:22:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2019-12-27 22:22:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 11656 transitions. [2019-12-27 22:22:08,655 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 11656 transitions. Word has length 68 [2019-12-27 22:22:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:08,655 INFO L462 AbstractCegarLoop]: Abstraction has 4160 states and 11656 transitions. [2019-12-27 22:22:08,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 22:22:08,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 11656 transitions. [2019-12-27 22:22:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:08,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:08,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:08,661 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:08,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1871389806, now seen corresponding path program 4 times [2019-12-27 22:22:08,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:08,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751044900] [2019-12-27 22:22:08,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:09,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:09,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751044900] [2019-12-27 22:22:09,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:09,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-27 22:22:09,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418063679] [2019-12-27 22:22:09,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:09,707 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:09,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 279 states and 548 transitions. [2019-12-27 22:22:09,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:10,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:10,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:22:10,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-27 22:22:10,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:10,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:10,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,148 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-27 22:22:11,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 22:22:11,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:11,405 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2019-12-27 22:22:11,406 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 44 times. [2019-12-27 22:22:11,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-27 22:22:11,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:11,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-27 22:22:11,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2019-12-27 22:22:11,407 INFO L87 Difference]: Start difference. First operand 4160 states and 11656 transitions. Second operand 32 states. [2019-12-27 22:22:18,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:18,198 INFO L93 Difference]: Finished difference Result 10541 states and 29452 transitions. [2019-12-27 22:22:18,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-27 22:22:18,199 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2019-12-27 22:22:18,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:18,212 INFO L225 Difference]: With dead ends: 10541 [2019-12-27 22:22:18,212 INFO L226 Difference]: Without dead ends: 10509 [2019-12-27 22:22:18,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 17 SyntacticMatches, 22 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=787, Invalid=3769, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 22:22:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10509 states. [2019-12-27 22:22:18,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10509 to 4908. [2019-12-27 22:22:18,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4908 states. [2019-12-27 22:22:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4908 states to 4908 states and 13859 transitions. [2019-12-27 22:22:18,318 INFO L78 Accepts]: Start accepts. Automaton has 4908 states and 13859 transitions. Word has length 68 [2019-12-27 22:22:18,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:18,318 INFO L462 AbstractCegarLoop]: Abstraction has 4908 states and 13859 transitions. [2019-12-27 22:22:18,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-27 22:22:18,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4908 states and 13859 transitions. [2019-12-27 22:22:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:18,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:18,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:18,323 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash -643206502, now seen corresponding path program 5 times [2019-12-27 22:22:18,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:18,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089801182] [2019-12-27 22:22:18,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:22:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:22:18,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089801182] [2019-12-27 22:22:18,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:22:18,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 22:22:18,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [70326092] [2019-12-27 22:22:18,626 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:22:18,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:22:18,971 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 494 transitions. [2019-12-27 22:22:18,971 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:22:19,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:22:19,523 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 32 times. [2019-12-27 22:22:19,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 22:22:19,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:22:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 22:22:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-12-27 22:22:19,525 INFO L87 Difference]: Start difference. First operand 4908 states and 13859 transitions. Second operand 19 states. [2019-12-27 22:22:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:22:20,875 INFO L93 Difference]: Finished difference Result 6871 states and 19168 transitions. [2019-12-27 22:22:20,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 22:22:20,876 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 68 [2019-12-27 22:22:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:22:20,885 INFO L225 Difference]: With dead ends: 6871 [2019-12-27 22:22:20,886 INFO L226 Difference]: Without dead ends: 6839 [2019-12-27 22:22:20,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 9 SyntacticMatches, 20 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 22:22:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6839 states. [2019-12-27 22:22:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6839 to 4069. [2019-12-27 22:22:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4069 states. [2019-12-27 22:22:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4069 states to 4069 states and 11331 transitions. [2019-12-27 22:22:20,957 INFO L78 Accepts]: Start accepts. Automaton has 4069 states and 11331 transitions. Word has length 68 [2019-12-27 22:22:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:22:20,957 INFO L462 AbstractCegarLoop]: Abstraction has 4069 states and 11331 transitions. [2019-12-27 22:22:20,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 22:22:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 4069 states and 11331 transitions. [2019-12-27 22:22:20,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 22:22:20,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:22:20,961 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:22:20,961 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:22:20,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:22:20,961 INFO L82 PathProgramCache]: Analyzing trace with hash 158566424, now seen corresponding path program 6 times [2019-12-27 22:22:20,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:22:20,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723110088] [2019-12-27 22:22:20,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:22:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:22:21,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:22:21,085 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:22:21,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] ULTIMATE.startENTRY-->L807: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t1970~0.offset_16|) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_20 0) (= |v_#NULL.offset_3| 0) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$flush_delayed~0_15) (= (store .cse0 |v_ULTIMATE.start_main_~#t1970~0.base_22| 1) |v_#valid_64|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1970~0.base_22|) 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~z$r_buff1_thd2~0_16) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff0_thd1~0_25 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1970~0.base_22| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1970~0.base_22|) |v_ULTIMATE.start_main_~#t1970~0.offset_16| 0)) |v_#memory_int_21|) (= 0 v_~__unbuffered_p2_EAX~0_10) (= 0 v_~weak$$choice0~0_7) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= 0 v_~y~0_8) (= 0 |v_#NULL.base_3|) (= 0 v_~z$w_buff0~0_28) (= 0 v_~z$r_buff1_thd1~0_19) (= v_~z$r_buff0_thd0~0_77 0) (= 0 v_~z$w_buff1_used~0_69) (= v_~main$tmp_guard1~0_13 0) (= 0 v_~z$r_buff1_thd0~0_46) (= v_~z~0_29 0) (= 0 v_~z$w_buff1~0_26) (= 0 v_~z$r_buff1_thd3~0_17) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1970~0.base_22| 4)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1970~0.base_22|) (= v_~z$w_buff0_used~0_116 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_7|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_11|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_14|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_9|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_12|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_14|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_77, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_8|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_11|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_14|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_69, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_11|, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_20, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ULTIMATE.start_main_~#t1970~0.base=|v_ULTIMATE.start_main_~#t1970~0.base_22|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_7|, ULTIMATE.start_main_~#t1970~0.offset=|v_ULTIMATE.start_main_~#t1970~0.offset_16|, ULTIMATE.start_main_~#t1971~0.base=|v_ULTIMATE.start_main_~#t1971~0.base_20|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_12|, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_9|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_15|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_11|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_46, ~y~0=v_~y~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_~#t1972~0.offset=|v_ULTIMATE.start_main_~#t1972~0.offset_15|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_7|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_17, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_11|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_11|, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|, ULTIMATE.start_main_~#t1972~0.base=|v_ULTIMATE.start_main_~#t1972~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_14|, ULTIMATE.start_main_~#t1971~0.offset=|v_ULTIMATE.start_main_~#t1971~0.offset_15|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_29, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_25} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1970~0.base, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_~#t1970~0.offset, ULTIMATE.start_main_~#t1971~0.base, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1972~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1972~0.base, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1971~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:21,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L807-1-->L809: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1971~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1971~0.base_11|) |v_ULTIMATE.start_main_~#t1971~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t1971~0.offset_10|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1971~0.base_11| 1) |v_#valid_35|) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1971~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1971~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1971~0.base_11| 4) |v_#length_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1971~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1971~0.offset=|v_ULTIMATE.start_main_~#t1971~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_4|, ULTIMATE.start_main_~#t1971~0.base=|v_ULTIMATE.start_main_~#t1971~0.base_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1971~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1971~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 22:22:21,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_17 v_~z$w_buff1~0_16) (= (mod v_~z$w_buff1_used~0_56 256) 0) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= 2 v_~z$w_buff0~0_16) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= v_~z$w_buff0_used~0_89 1) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|) (= v_~z$w_buff0_used~0_90 v_~z$w_buff1_used~0_56)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_90, ~z$w_buff0~0=v_~z$w_buff0~0_17, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_89, ~z$w_buff0~0=v_~z$w_buff0~0_16, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~z$w_buff1~0=v_~z$w_buff1~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 22:22:21,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-1-->L811: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1972~0.base_12|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1972~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1972~0.base_12|) |v_ULTIMATE.start_main_~#t1972~0.offset_10| 2))) (not (= |v_ULTIMATE.start_main_~#t1972~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1972~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1972~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1972~0.base_12| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1972~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1972~0.offset=|v_ULTIMATE.start_main_~#t1972~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1972~0.base=|v_ULTIMATE.start_main_~#t1972~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1972~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1972~0.base] because there is no mapped edge [2019-12-27 22:22:21,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1806382659 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1806382659 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1806382659| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1806382659| ~z$w_buff0_used~0_In-1806382659)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806382659, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1806382659} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1806382659|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1806382659, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1806382659} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 22:22:21,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-643220577 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-643220577 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-643220577 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-643220577 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-643220577|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-643220577 |P0Thread1of1ForFork0_#t~ite6_Out-643220577|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-643220577, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-643220577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-643220577, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-643220577} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-643220577|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-643220577, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-643220577, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-643220577, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-643220577} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 22:22:21,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-1853944606 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1853944606 256)))) (or (and (not .cse0) (= ~z$r_buff0_thd1~0_Out-1853944606 0) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out-1853944606 ~z$r_buff0_thd1~0_In-1853944606)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853944606, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1853944606} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1853944606, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1853944606|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1853944606} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 22:22:21,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L748-->L748-2: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-2033296035 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-2033296035 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-2033296035 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2033296035 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-2033296035|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-2033296035| ~z$r_buff1_thd1~0_In-2033296035) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033296035, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2033296035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2033296035, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2033296035} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033296035, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2033296035|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-2033296035, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2033296035, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2033296035} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 22:22:21,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L748-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_14)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_14, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 22:22:21,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L764-2-->L764-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1865755871 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1865755871 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In1865755871 |P1Thread1of1ForFork1_#t~ite9_Out1865755871|)) (and (not .cse0) (= ~z$w_buff1~0_In1865755871 |P1Thread1of1ForFork1_#t~ite9_Out1865755871|) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1865755871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1865755871, ~z$w_buff1~0=~z$w_buff1~0_In1865755871, ~z~0=~z~0_In1865755871} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1865755871|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1865755871, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1865755871, ~z$w_buff1~0=~z$w_buff1~0_In1865755871, ~z~0=~z~0_In1865755871} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 22:22:21,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L764-4-->L765: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~z~0_20) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 22:22:21,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L765-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In494990112 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In494990112 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out494990112| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In494990112 |P1Thread1of1ForFork1_#t~ite11_Out494990112|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In494990112, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In494990112} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In494990112, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out494990112|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In494990112} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 22:22:21,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L784-2-->L784-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In883044285 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In883044285 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out883044285| ~z$w_buff1~0_In883044285) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out883044285| ~z~0_In883044285) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In883044285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In883044285, ~z$w_buff1~0=~z$w_buff1~0_In883044285, ~z~0=~z~0_In883044285} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out883044285|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In883044285, ~z$w_buff1_used~0=~z$w_buff1_used~0_In883044285, ~z$w_buff1~0=~z$w_buff1~0_In883044285, ~z~0=~z~0_In883044285} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 22:22:21,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In601150309 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In601150309 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In601150309 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In601150309 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out601150309| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite12_Out601150309| ~z$w_buff1_used~0_In601150309) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In601150309, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In601150309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In601150309, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In601150309} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In601150309, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In601150309, ~z$w_buff1_used~0=~z$w_buff1_used~0_In601150309, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out601150309|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In601150309} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 22:22:21,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-352412401 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-352412401 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-352412401 |P1Thread1of1ForFork1_#t~ite13_Out-352412401|)) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-352412401|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-352412401, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-352412401} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-352412401, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-352412401|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-352412401} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 22:22:21,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L784-4-->L785: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~z~0_21) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~z~0=v_~z~0_21, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 22:22:21,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-476566954 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-476566954 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out-476566954| 0)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-476566954| ~z$w_buff0_used~0_In-476566954) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-476566954, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-476566954} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-476566954, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-476566954, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-476566954|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:22:21,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In2021448879 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In2021448879 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2021448879 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In2021448879 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite18_Out2021448879| ~z$w_buff1_used~0_In2021448879) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out2021448879| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2021448879, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2021448879, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2021448879, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2021448879} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2021448879, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In2021448879, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2021448879, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In2021448879, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out2021448879|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 22:22:21,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L787-->L787-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-359808437 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-359808437 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite19_Out-359808437| ~z$r_buff0_thd3~0_In-359808437) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out-359808437| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-359808437, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-359808437} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-359808437, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-359808437, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-359808437|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 22:22:21,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L788-->L788-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In555468923 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In555468923 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In555468923 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In555468923 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out555468923|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In555468923 |P2Thread1of1ForFork2_#t~ite20_Out555468923|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In555468923, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In555468923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In555468923, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In555468923} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In555468923, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out555468923|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In555468923, ~z$w_buff1_used~0=~z$w_buff1_used~0_In555468923, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In555468923} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 22:22:21,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_8| v_~z$r_buff1_thd3~0_12)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_12, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 22:22:21,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-388415644 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-388415644 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-388415644 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-388415644 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-388415644| ~z$r_buff1_thd2~0_In-388415644) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-388415644|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-388415644, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-388415644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-388415644, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-388415644} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-388415644, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-388415644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-388415644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-388415644|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-388415644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 22:22:21,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L768-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_10 |v_P1Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 22:22:21,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L811-1-->L817: Formula: (and (= v_~__unbuffered_cnt~0_9 3) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 22:22:21,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L817-2-->L817-4: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1332759652 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1332759652 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1332759652 |ULTIMATE.start_main_#t~ite24_Out-1332759652|)) (and (not .cse1) (= ~z$w_buff1~0_In-1332759652 |ULTIMATE.start_main_#t~ite24_Out-1332759652|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1332759652, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1332759652, ~z$w_buff1~0=~z$w_buff1~0_In-1332759652, ~z~0=~z~0_In-1332759652} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1332759652, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1332759652|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1332759652, ~z$w_buff1~0=~z$w_buff1~0_In-1332759652, ~z~0=~z~0_In-1332759652} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 22:22:21,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L817-4-->L818: Formula: (= v_~z~0_17 |v_ULTIMATE.start_main_#t~ite24_7|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_6|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_6|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~z~0] because there is no mapped edge [2019-12-27 22:22:21,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1598575392 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1598575392 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1598575392| ~z$w_buff0_used~0_In1598575392)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out1598575392|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1598575392, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1598575392} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1598575392, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1598575392, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1598575392|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 22:22:21,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In2135990426 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In2135990426 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In2135990426 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In2135990426 256)))) (or (and (= ~z$w_buff1_used~0_In2135990426 |ULTIMATE.start_main_#t~ite27_Out2135990426|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out2135990426|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135990426, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135990426, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135990426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135990426} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135990426, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135990426, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2135990426, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2135990426, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out2135990426|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 22:22:21,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-36182150 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-36182150 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite28_Out-36182150|)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In-36182150 |ULTIMATE.start_main_#t~ite28_Out-36182150|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-36182150, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-36182150} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-36182150, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-36182150|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-36182150} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 22:22:21,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In706031240 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In706031240 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In706031240 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In706031240 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite29_Out706031240| ~z$r_buff1_thd0~0_In706031240) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out706031240| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706031240, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706031240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In706031240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In706031240} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In706031240, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out706031240|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In706031240, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In706031240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In706031240} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 22:22:21,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L833-->L834: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~z$r_buff0_thd0~0_69 v_~z$r_buff0_thd0~0_70)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_70, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_69, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_7|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 22:22:21,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L836-->L4: Formula: (and (= 0 v_~z$flush_delayed~0_10) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4| (mod v_~main$tmp_guard1~0_8 256)) (not (= (mod v_~z$flush_delayed~0_11 256) 0)) (= v_~z~0_25 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_11} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_10, ~z~0=v_~z~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:22:21,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 22:22:21,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:22:21 BasicIcfg [2019-12-27 22:22:21,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:22:21,208 INFO L168 Benchmark]: Toolchain (without parser) took 126280.00 ms. Allocated memory was 135.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 98.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 980.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:21,209 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:22:21,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.67 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 153.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:21,210 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.76 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:21,210 INFO L168 Benchmark]: Boogie Preprocessor took 48.33 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:21,211 INFO L168 Benchmark]: RCFGBuilder took 847.42 ms. Allocated memory is still 199.8 MB. Free memory was 147.6 MB in the beginning and 97.6 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:21,212 INFO L168 Benchmark]: TraceAbstraction took 124523.70 ms. Allocated memory was 199.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 96.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 915.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:22:21,215 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 135.8 MB. Free memory was 117.7 MB in the beginning and 117.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.67 ms. Allocated memory was 135.8 MB in the beginning and 199.8 MB in the end (delta: 64.0 MB). Free memory was 97.8 MB in the beginning and 153.1 MB in the end (delta: -55.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.76 ms. Allocated memory is still 199.8 MB. Free memory was 153.1 MB in the beginning and 150.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.33 ms. Allocated memory is still 199.8 MB. Free memory was 150.3 MB in the beginning and 147.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.42 ms. Allocated memory is still 199.8 MB. Free memory was 147.6 MB in the beginning and 97.6 MB in the end (delta: 49.9 MB). Peak memory consumption was 49.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124523.70 ms. Allocated memory was 199.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 96.9 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 915.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 175 ProgramPointsBefore, 98 ProgramPointsAfterwards, 212 TransitionsBefore, 111 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 28 ChoiceCompositions, 5348 VarBasedMoverChecksPositive, 177 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 84694 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L807] FCALL, FORK 0 pthread_create(&t1970, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t1971, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L811] FCALL, FORK 0 pthread_create(&t1972, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 __unbuffered_p1_EAX = x [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 __unbuffered_p2_EAX = y [L781] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L784] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L825] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L826] 0 z$flush_delayed = weak$$choice2 [L827] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L829] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L831] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L832] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 124.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 36.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3274 SDtfs, 5098 SDslu, 12597 SDs, 0 SdLazy, 11620 SolverSat, 488 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 483 GetRequests, 112 SyntacticMatches, 108 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2221 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221154occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 47.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 105170 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1053 NumberOfCodeBlocks, 1053 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 294028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...