/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:29:13,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:29:13,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:29:13,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:29:13,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:29:13,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:29:13,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:29:13,612 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:29:13,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:29:13,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:29:13,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:29:13,617 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:29:13,617 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:29:13,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:29:13,622 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:29:13,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:29:13,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:29:13,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:29:13,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:29:13,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:29:13,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:29:13,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:29:13,642 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:29:13,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:29:13,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:29:13,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:29:13,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:29:13,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:29:13,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:29:13,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:29:13,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:29:13,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:29:13,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:29:13,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:29:13,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:29:13,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:29:13,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:29:13,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:29:13,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:29:13,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:29:13,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:29:13,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:29:13,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:29:13,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:29:13,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:29:13,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:29:13,693 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:29:13,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:29:13,693 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:29:13,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:29:13,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:29:13,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:29:13,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:29:13,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:29:13,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:29:13,695 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:29:13,695 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:29:13,695 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:29:13,695 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:29:13,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:29:13,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:29:13,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:29:13,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:29:13,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:29:13,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:29:13,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:29:13,697 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:29:13,697 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:29:13,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:29:13,698 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:29:13,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:29:13,698 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:29:13,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:29:13,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:29:13,986 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:29:13,989 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:29:13,991 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:29:13,991 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:29:13,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-27 17:29:14,052 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5cebd59/1212dbc589064a5a8b91b481743eae21/FLAGa412c131f [2019-12-27 17:29:14,613 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:29:14,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.opt.i [2019-12-27 17:29:14,639 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5cebd59/1212dbc589064a5a8b91b481743eae21/FLAGa412c131f [2019-12-27 17:29:14,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb5cebd59/1212dbc589064a5a8b91b481743eae21 [2019-12-27 17:29:14,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:29:14,891 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:29:14,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:29:14,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:29:14,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:29:14,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:29:14" (1/1) ... [2019-12-27 17:29:14,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:14, skipping insertion in model container [2019-12-27 17:29:14,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:29:14" (1/1) ... [2019-12-27 17:29:14,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:29:14,959 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:29:15,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:29:15,537 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:29:15,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:29:15,705 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:29:15,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15 WrapperNode [2019-12-27 17:29:15,706 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:29:15,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:29:15,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:29:15,707 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:29:15,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,781 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:29:15,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:29:15,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:29:15,782 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:29:15,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,797 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,797 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (1/1) ... [2019-12-27 17:29:15,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:29:15,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:29:15,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:29:15,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:29:15,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29: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 17:29:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:29:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:29:15,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:29:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:29:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:29:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:29:15,892 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:29:15,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:29:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:29:15,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:29:15,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:29:15,895 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 17:29:16,640 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:29:16,640 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:29:16,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:29:16 BoogieIcfgContainer [2019-12-27 17:29:16,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:29:16,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:29:16,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:29:16,647 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:29:16,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:29:14" (1/3) ... [2019-12-27 17:29:16,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba0b08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:29:16, skipping insertion in model container [2019-12-27 17:29:16,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:29:15" (2/3) ... [2019-12-27 17:29:16,649 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba0b08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:29:16, skipping insertion in model container [2019-12-27 17:29:16,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:29:16" (3/3) ... [2019-12-27 17:29:16,651 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.opt.i [2019-12-27 17:29:16,661 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:29:16,661 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:29:16,669 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:29:16,670 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:29:16,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,713 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,714 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,728 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,728 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,732 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,732 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:29:16,750 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:29:16,772 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:29:16,772 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:29:16,772 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:29:16,772 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:29:16,773 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:29:16,773 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:29:16,773 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:29:16,773 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:29:16,813 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 17:29:16,815 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 17:29:16,897 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 17:29:16,897 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:29:16,912 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:29:16,928 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 17:29:16,971 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 17:29:16,971 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:29:16,976 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:29:16,990 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 17:29:16,991 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:29:21,326 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 17:29:21,464 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-27 17:29:21,464 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 17:29:21,468 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 17:29:21,930 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-27 17:29:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-27 17:29:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 17:29:21,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:21,941 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 17:29:21,942 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:21,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-27 17:29:21,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:21,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763395236] [2019-12-27 17:29:21,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:22,198 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 17:29:22,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763395236] [2019-12-27 17:29:22,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:22,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:29:22,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1515214171] [2019-12-27 17:29:22,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:22,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:22,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 17:29:22,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:22,225 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:29:22,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:29:22,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:22,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:29:22,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:29:22,244 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-27 17:29:22,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:22,503 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-27 17:29:22,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:29:22,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 17:29:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:22,595 INFO L225 Difference]: With dead ends: 8377 [2019-12-27 17:29:22,595 INFO L226 Difference]: Without dead ends: 8208 [2019-12-27 17:29:22,598 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 17:29:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-27 17:29:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-27 17:29:23,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-27 17:29:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-27 17:29:23,251 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-27 17:29:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:23,252 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-27 17:29:23,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:29:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-27 17:29:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:29:23,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:23,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:29:23,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:23,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:23,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-27 17:29:23,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:23,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993783311] [2019-12-27 17:29:23,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:23,317 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 17:29:23,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993783311] [2019-12-27 17:29:23,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:23,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:29:23,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1785518132] [2019-12-27 17:29:23,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:23,320 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:23,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:29:23,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:23,322 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:29:23,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:29:23,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:23,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:29:23,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:29:23,325 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-27 17:29:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:23,360 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-27 17:29:23,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:29:23,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 17:29:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:23,368 INFO L225 Difference]: With dead ends: 1326 [2019-12-27 17:29:23,368 INFO L226 Difference]: Without dead ends: 1326 [2019-12-27 17:29:23,369 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 17:29:23,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-27 17:29:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-27 17:29:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-27 17:29:23,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-27 17:29:23,415 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-27 17:29:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:23,416 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-27 17:29:23,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:29:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-27 17:29:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:29:23,418 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:23,419 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:29:23,419 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:23,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:23,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-27 17:29:23,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:23,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188985752] [2019-12-27 17:29:23,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:23,575 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 17:29:23,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188985752] [2019-12-27 17:29:23,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:23,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:29:23,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061621284] [2019-12-27 17:29:23,577 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:23,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:23,583 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 17:29:23,584 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:23,649 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:29:23,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:29:23,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:23,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:29:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:29:23,651 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 5 states. [2019-12-27 17:29:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:23,997 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-27 17:29:23,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:29:23,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 17:29:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:24,008 INFO L225 Difference]: With dead ends: 1806 [2019-12-27 17:29:24,008 INFO L226 Difference]: Without dead ends: 1806 [2019-12-27 17:29:24,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:29:24,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-27 17:29:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-27 17:29:24,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 17:29:24,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-27 17:29:24,054 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-27 17:29:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:24,054 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-27 17:29:24,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:29:24,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-27 17:29:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 17:29:24,058 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:24,058 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] [2019-12-27 17:29:24,058 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:24,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-27 17:29:24,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:24,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708034306] [2019-12-27 17:29:24,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:24,167 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 17:29:24,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708034306] [2019-12-27 17:29:24,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:24,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:29:24,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [434999227] [2019-12-27 17:29:24,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:24,177 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:24,187 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 71 transitions. [2019-12-27 17:29:24,187 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:24,203 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:29:24,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:29:24,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:24,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:29:24,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:29:24,205 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 5 states. [2019-12-27 17:29:24,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:24,229 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-27 17:29:24,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:29:24,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 17:29:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:24,232 INFO L225 Difference]: With dead ends: 356 [2019-12-27 17:29:24,232 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 17:29:24,232 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 17:29:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 17:29:24,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-27 17:29:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 17:29:24,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-27 17:29:24,242 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-27 17:29:24,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:24,242 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-27 17:29:24,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:29:24,243 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-27 17:29:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:29:24,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:24,245 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] [2019-12-27 17:29:24,246 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:24,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:24,246 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-27 17:29:24,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:24,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644210402] [2019-12-27 17:29:24,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:24,347 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 17:29:24,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644210402] [2019-12-27 17:29:24,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:24,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:29:24,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [365546101] [2019-12-27 17:29:24,348 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:24,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:24,485 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 17:29:24,486 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:24,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:29:24,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:29:24,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:24,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:29:24,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:29:24,488 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-27 17:29:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:24,548 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-27 17:29:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:29:24,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:29:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:24,550 INFO L225 Difference]: With dead ends: 331 [2019-12-27 17:29:24,551 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 17:29:24,551 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 17:29:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 17:29:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-27 17:29:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 17:29:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-27 17:29:24,560 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-27 17:29:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:24,562 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-27 17:29:24,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:29:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-27 17:29:24,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:29:24,566 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:24,566 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] [2019-12-27 17:29:24,567 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:24,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-27 17:29:24,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:24,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690466756] [2019-12-27 17:29:24,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:24,711 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 17:29:24,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690466756] [2019-12-27 17:29:24,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:24,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:29:24,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [202079505] [2019-12-27 17:29:24,712 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:24,730 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:24,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 77 states and 100 transitions. [2019-12-27 17:29:24,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:24,776 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:29:24,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:29:24,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:24,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:29:24,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:29:24,777 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-27 17:29:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:24,994 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-27 17:29:24,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:29:24,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 17:29:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:24,997 INFO L225 Difference]: With dead ends: 458 [2019-12-27 17:29:24,997 INFO L226 Difference]: Without dead ends: 458 [2019-12-27 17:29:24,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:29:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-27 17:29:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-27 17:29:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-27 17:29:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-27 17:29:25,010 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-27 17:29:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:25,013 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-27 17:29:25,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:29:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-27 17:29:25,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:29:25,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:25,016 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] [2019-12-27 17:29:25,016 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:25,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:25,017 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-27 17:29:25,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:25,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274687105] [2019-12-27 17:29:25,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:25,190 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 17:29:25,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274687105] [2019-12-27 17:29:25,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:25,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:29:25,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142079208] [2019-12-27 17:29:25,192 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:25,205 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:25,590 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 90 transitions. [2019-12-27 17:29:25,591 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:25,592 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:29:25,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:29:25,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:25,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:29:25,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:29:25,594 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-27 17:29:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:25,922 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-27 17:29:25,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:29:25,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 17:29:25,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:25,929 INFO L225 Difference]: With dead ends: 513 [2019-12-27 17:29:25,929 INFO L226 Difference]: Without dead ends: 513 [2019-12-27 17:29:25,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:29:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-27 17:29:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-27 17:29:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 17:29:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-27 17:29:25,942 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-27 17:29:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:25,943 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-27 17:29:25,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:29:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-27 17:29:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:29:25,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:25,945 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] [2019-12-27 17:29:25,945 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:25,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-27 17:29:25,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:25,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393717800] [2019-12-27 17:29:25,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:26,057 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 17:29:26,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393717800] [2019-12-27 17:29:26,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:26,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:29:26,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [520490891] [2019-12-27 17:29:26,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:26,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:26,106 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 103 transitions. [2019-12-27 17:29:26,106 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:26,194 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:29:26,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:29:26,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:26,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:29:26,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:29:26,195 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 10 states. [2019-12-27 17:29:27,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:27,372 INFO L93 Difference]: Finished difference Result 1004 states and 1752 transitions. [2019-12-27 17:29:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:29:27,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-27 17:29:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:27,379 INFO L225 Difference]: With dead ends: 1004 [2019-12-27 17:29:27,379 INFO L226 Difference]: Without dead ends: 1004 [2019-12-27 17:29:27,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:29:27,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-27 17:29:27,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 445. [2019-12-27 17:29:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-27 17:29:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-27 17:29:27,394 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-27 17:29:27,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:27,395 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-27 17:29:27,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:29:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-27 17:29:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:29:27,396 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:27,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] [2019-12-27 17:29:27,397 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:27,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:27,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-27 17:29:27,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:27,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962077263] [2019-12-27 17:29:27,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:27,445 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 17:29:27,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962077263] [2019-12-27 17:29:27,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:27,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:29:27,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [157668728] [2019-12-27 17:29:27,446 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:27,459 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:27,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 78 states and 102 transitions. [2019-12-27 17:29:27,492 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:27,508 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:29:27,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:29:27,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:27,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:29:27,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:29:27,510 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 5 states. [2019-12-27 17:29:27,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:27,623 INFO L93 Difference]: Finished difference Result 510 states and 916 transitions. [2019-12-27 17:29:27,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:29:27,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 17:29:27,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:27,627 INFO L225 Difference]: With dead ends: 510 [2019-12-27 17:29:27,627 INFO L226 Difference]: Without dead ends: 510 [2019-12-27 17:29:27,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 17:29:27,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-12-27 17:29:27,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 406. [2019-12-27 17:29:27,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 17:29:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-27 17:29:27,638 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-27 17:29:27,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:27,639 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-27 17:29:27,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:29:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-27 17:29:27,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:29:27,640 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:27,640 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] [2019-12-27 17:29:27,640 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:27,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:27,641 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-27 17:29:27,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:27,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676533786] [2019-12-27 17:29:27,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:27,832 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 17:29:27,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676533786] [2019-12-27 17:29:27,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:27,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 17:29:27,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [971485788] [2019-12-27 17:29:27,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:27,848 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:27,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 109 transitions. [2019-12-27 17:29:27,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:27,982 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:29:27,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:29:27,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:27,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:29:27,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:29:27,983 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 11 states. [2019-12-27 17:29:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:28,312 INFO L93 Difference]: Finished difference Result 748 states and 1355 transitions. [2019-12-27 17:29:28,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:29:28,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 53 [2019-12-27 17:29:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:28,316 INFO L225 Difference]: With dead ends: 748 [2019-12-27 17:29:28,316 INFO L226 Difference]: Without dead ends: 369 [2019-12-27 17:29:28,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:29:28,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-27 17:29:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 321. [2019-12-27 17:29:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 17:29:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 572 transitions. [2019-12-27 17:29:28,324 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 572 transitions. Word has length 53 [2019-12-27 17:29:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:28,325 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 572 transitions. [2019-12-27 17:29:28,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:29:28,325 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 572 transitions. [2019-12-27 17:29:28,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:29:28,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:28,326 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] [2019-12-27 17:29:28,327 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:28,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1236840700, now seen corresponding path program 2 times [2019-12-27 17:29:28,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:28,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816309507] [2019-12-27 17:29:28,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:28,398 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 17:29:28,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816309507] [2019-12-27 17:29:28,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:28,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:29:28,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562630435] [2019-12-27 17:29:28,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:28,413 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:28,448 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 102 transitions. [2019-12-27 17:29:28,448 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:28,449 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:29:28,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:29:28,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:28,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:29:28,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:29:28,450 INFO L87 Difference]: Start difference. First operand 321 states and 572 transitions. Second operand 3 states. [2019-12-27 17:29:28,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:28,484 INFO L93 Difference]: Finished difference Result 321 states and 571 transitions. [2019-12-27 17:29:28,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:29:28,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 17:29:28,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:28,486 INFO L225 Difference]: With dead ends: 321 [2019-12-27 17:29:28,486 INFO L226 Difference]: Without dead ends: 321 [2019-12-27 17:29:28,487 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 17:29:28,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-27 17:29:28,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 209. [2019-12-27 17:29:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-12-27 17:29:28,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 369 transitions. [2019-12-27 17:29:28,492 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 369 transitions. Word has length 53 [2019-12-27 17:29:28,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:28,492 INFO L462 AbstractCegarLoop]: Abstraction has 209 states and 369 transitions. [2019-12-27 17:29:28,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:29:28,492 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 369 transitions. [2019-12-27 17:29:28,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:29:28,493 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:28,493 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] [2019-12-27 17:29:28,493 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:28,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:28,494 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 1 times [2019-12-27 17:29:28,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:28,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025966] [2019-12-27 17:29:28,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:28,752 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 17:29:28,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025966] [2019-12-27 17:29:28,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:28,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:29:28,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128639807] [2019-12-27 17:29:28,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:28,803 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:28,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 66 states and 75 transitions. [2019-12-27 17:29:28,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:28,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:29:28,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:29:28,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:29:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:29:28,868 INFO L87 Difference]: Start difference. First operand 209 states and 369 transitions. Second operand 13 states. [2019-12-27 17:29:29,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:29,436 INFO L93 Difference]: Finished difference Result 378 states and 650 transitions. [2019-12-27 17:29:29,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 17:29:29,437 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 17:29:29,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:29,440 INFO L225 Difference]: With dead ends: 378 [2019-12-27 17:29:29,440 INFO L226 Difference]: Without dead ends: 343 [2019-12-27 17:29:29,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-12-27 17:29:29,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-12-27 17:29:29,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 309. [2019-12-27 17:29:29,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-12-27 17:29:29,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 540 transitions. [2019-12-27 17:29:29,448 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 540 transitions. Word has length 54 [2019-12-27 17:29:29,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:29,448 INFO L462 AbstractCegarLoop]: Abstraction has 309 states and 540 transitions. [2019-12-27 17:29:29,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:29:29,448 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 540 transitions. [2019-12-27 17:29:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:29:29,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:29,449 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] [2019-12-27 17:29:29,450 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:29,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:29,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 2 times [2019-12-27 17:29:29,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:29,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839933972] [2019-12-27 17:29:29,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:29:29,728 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 17:29:29,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839933972] [2019-12-27 17:29:29,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:29:29,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 17:29:29,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [593420315] [2019-12-27 17:29:29,730 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:29:29,743 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:29:29,782 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 111 transitions. [2019-12-27 17:29:29,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:29:29,820 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:29:29,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 17:29:29,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:29:29,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 17:29:29,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:29:29,822 INFO L87 Difference]: Start difference. First operand 309 states and 540 transitions. Second operand 13 states. [2019-12-27 17:29:30,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:29:30,299 INFO L93 Difference]: Finished difference Result 414 states and 701 transitions. [2019-12-27 17:29:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 17:29:30,300 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 17:29:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:29:30,302 INFO L225 Difference]: With dead ends: 414 [2019-12-27 17:29:30,303 INFO L226 Difference]: Without dead ends: 379 [2019-12-27 17:29:30,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:29:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-27 17:29:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 317. [2019-12-27 17:29:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-27 17:29:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 554 transitions. [2019-12-27 17:29:30,311 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 554 transitions. Word has length 54 [2019-12-27 17:29:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:29:30,311 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 554 transitions. [2019-12-27 17:29:30,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 17:29:30,312 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 554 transitions. [2019-12-27 17:29:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 17:29:30,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:29:30,313 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] [2019-12-27 17:29:30,313 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:29:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:29:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 3 times [2019-12-27 17:29:30,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:29:30,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515661138] [2019-12-27 17:29:30,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:29:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:29:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:29:30,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:29:30,409 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:29:30,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= 0 v_~x~0_144) (= v_~x$r_buff0_thd1~0_115 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) |v_ULTIMATE.start_main_~#t1455~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x$r_buff0_thd2~0_168) (= (store .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22| 1) |v_#valid_47|) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1455~0.base_22| 4)) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1455~0.base_22|) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1455~0.base_22|) 0) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, ULTIMATE.start_main_~#t1455~0.base=|v_ULTIMATE.start_main_~#t1455~0.base_22|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_14|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_144, ULTIMATE.start_main_~#t1455~0.offset=|v_ULTIMATE.start_main_~#t1455~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_17|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1455~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ULTIMATE.start_main_~#t1456~0.offset, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1455~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:29:30,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10| 1) |v_#valid_25|) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1456~0.base_10| 4) |v_#length_9|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1456~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1456~0.base_10|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1456~0.base_10|) |v_ULTIMATE.start_main_~#t1456~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1456~0.offset_9| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1456~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1456~0.base=|v_ULTIMATE.start_main_~#t1456~0.base_10|, ULTIMATE.start_main_~#t1456~0.offset=|v_ULTIMATE.start_main_~#t1456~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1456~0.base, ULTIMATE.start_main_~#t1456~0.offset] because there is no mapped edge [2019-12-27 17:29:30,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 17:29:30,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse0 (= |P0Thread1of1ForFork0_#t~ite3_Out1523733808| |P0Thread1of1ForFork0_#t~ite4_Out1523733808|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1523733808 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1523733808 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out1523733808| ~x~0_In1523733808) .cse0 (or .cse1 .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out1523733808| ~x$w_buff1~0_In1523733808) .cse0 (not .cse1) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1523733808, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1523733808, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1523733808, ~x~0=~x~0_In1523733808} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1523733808|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1523733808|, ~x$w_buff1~0=~x$w_buff1~0_In1523733808, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1523733808, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1523733808, ~x~0=~x~0_In1523733808} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 17:29:30,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In267255739 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In267255739 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In267255739 |P0Thread1of1ForFork0_#t~ite5_Out267255739|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out267255739|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In267255739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In267255739} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out267255739|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In267255739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In267255739} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:29:30,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In-1784525651 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1784525651 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1784525651 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1784525651 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1784525651| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1784525651| ~x$w_buff1_used~0_In-1784525651) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1784525651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1784525651|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1784525651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:29:30,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In534998676 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In534998676 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out534998676|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In534998676 |P1Thread1of1ForFork1_#t~ite11_Out534998676|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In534998676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534998676} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out534998676|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In534998676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534998676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 17:29:30,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-81740409 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-81740409 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-81740409| 0) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In-81740409 |P0Thread1of1ForFork0_#t~ite7_Out-81740409|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-81740409, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81740409} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-81740409, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-81740409|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-81740409} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:29:30,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1280788763 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1280788763 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In1280788763 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1280788763 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1280788763|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In1280788763 |P0Thread1of1ForFork0_#t~ite8_Out1280788763|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1280788763, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280788763, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1280788763, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1280788763|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280788763, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:29:30,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 17:29:30,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd2~0_In2129325763 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In2129325763 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In2129325763 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In2129325763 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out2129325763| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite12_Out2129325763| ~x$w_buff1_used~0_In2129325763) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2129325763, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2129325763, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129325763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2129325763, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2129325763, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2129325763|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2129325763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 17:29:30,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1917086711 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1917086711 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out1917086711 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out1917086711 ~x$r_buff0_thd2~0_In1917086711)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1917086711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1917086711} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1917086711|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1917086711, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1917086711} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 17:29:30,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1214280787 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1214280787 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In1214280787 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In1214280787 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1214280787| ~x$r_buff1_thd2~0_In1214280787)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out1214280787| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1214280787, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1214280787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1214280787} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1214280787, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1214280787, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1214280787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1214280787} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:29:30,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:29:30,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:29:30,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In452730106 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite18_Out452730106| |ULTIMATE.start_main_#t~ite17_Out452730106|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In452730106 256) 0))) (or (and (= ~x~0_In452730106 |ULTIMATE.start_main_#t~ite17_Out452730106|) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In452730106 |ULTIMATE.start_main_#t~ite17_Out452730106|) (not .cse1) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In452730106, ~x$w_buff1_used~0=~x$w_buff1_used~0_In452730106, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In452730106, ~x~0=~x~0_In452730106} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out452730106|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out452730106|, ~x$w_buff1~0=~x$w_buff1~0_In452730106, ~x$w_buff1_used~0=~x$w_buff1_used~0_In452730106, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In452730106, ~x~0=~x~0_In452730106} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 17:29:30,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1843932393 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1843932393 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite19_Out-1843932393| ~x$w_buff0_used~0_In-1843932393)) (and (= |ULTIMATE.start_main_#t~ite19_Out-1843932393| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1843932393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1843932393, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1843932393|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:29:30,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1014658524 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1014658524 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1014658524 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1014658524 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1014658524 |ULTIMATE.start_main_#t~ite20_Out-1014658524|)) (and (= 0 |ULTIMATE.start_main_#t~ite20_Out-1014658524|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1014658524, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1014658524, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1014658524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014658524} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1014658524, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1014658524, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1014658524|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1014658524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1014658524} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:29:30,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-465279958 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-465279958 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out-465279958| ~x$r_buff0_thd0~0_In-465279958) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite21_Out-465279958|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-465279958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-465279958} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-465279958, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-465279958|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-465279958} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:29:30,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In291041392 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In291041392 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In291041392 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In291041392 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out291041392| ~x$r_buff1_thd0~0_In291041392) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite22_Out291041392|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In291041392, ~x$w_buff1_used~0=~x$w_buff1_used~0_In291041392, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In291041392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In291041392, ~x$w_buff1_used~0=~x$w_buff1_used~0_In291041392, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In291041392, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out291041392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:29:30,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1811447814 256)))) (or (and (= |ULTIMATE.start_main_#t~ite32_Out-1811447814| ~x$w_buff1~0_In-1811447814) (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In-1811447814| |ULTIMATE.start_main_#t~ite31_Out-1811447814|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out-1811447814| ~x$w_buff1~0_In-1811447814) (= |ULTIMATE.start_main_#t~ite32_Out-1811447814| |ULTIMATE.start_main_#t~ite31_Out-1811447814|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1811447814 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1811447814 256)) (and .cse1 (= (mod ~x$r_buff1_thd0~0_In-1811447814 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1811447814 256) 0))))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1811447814, ~x$w_buff1~0=~x$w_buff1~0_In-1811447814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1811447814, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1811447814, ~weak$$choice2~0=~weak$$choice2~0_In-1811447814, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-1811447814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1811447814} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1811447814, ~x$w_buff1~0=~x$w_buff1~0_In-1811447814, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1811447814, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-1811447814|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1811447814, ~weak$$choice2~0=~weak$$choice2~0_In-1811447814, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-1811447814|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1811447814} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 17:29:30,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:29:30,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:29:30,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:29:30,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:29:30 BasicIcfg [2019-12-27 17:29:30,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:29:30,516 INFO L168 Benchmark]: Toolchain (without parser) took 15625.95 ms. Allocated memory was 146.8 MB in the beginning and 598.2 MB in the end (delta: 451.4 MB). Free memory was 102.9 MB in the beginning and 365.5 MB in the end (delta: -262.7 MB). Peak memory consumption was 188.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:29:30,517 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:29:30,518 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.17 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 158.6 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:29:30,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.78 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:29:30,519 INFO L168 Benchmark]: Boogie Preprocessor took 37.08 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:29:30,520 INFO L168 Benchmark]: RCFGBuilder took 823.13 ms. Allocated memory is still 204.5 MB. Free memory was 153.5 MB in the beginning and 109.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:29:30,521 INFO L168 Benchmark]: TraceAbstraction took 13871.31 ms. Allocated memory was 204.5 MB in the beginning and 598.2 MB in the end (delta: 393.7 MB). Free memory was 109.1 MB in the beginning and 365.5 MB in the end (delta: -256.4 MB). Peak memory consumption was 137.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:29:30,528 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.18 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 814.17 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 102.5 MB in the beginning and 158.6 MB in the end (delta: -56.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.78 ms. Allocated memory is still 204.5 MB. Free memory was 158.6 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.08 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 153.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 823.13 ms. Allocated memory is still 204.5 MB. Free memory was 153.5 MB in the beginning and 109.7 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13871.31 ms. Allocated memory was 204.5 MB in the beginning and 598.2 MB in the end (delta: 393.7 MB). Free memory was 109.1 MB in the beginning and 365.5 MB in the end (delta: -256.4 MB). Peak memory consumption was 137.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1455, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1456, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1286 SDtfs, 1543 SDslu, 3636 SDs, 0 SdLazy, 2395 SolverSat, 173 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 36 SyntacticMatches, 21 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 1301 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 578 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 511 ConstructedInterpolants, 0 QuantifiedInterpolants, 92967 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...