/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/safe022_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:31:11,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:31:11,732 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:31:11,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:31:11,744 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:31:11,745 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:31:11,747 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:31:11,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:31:11,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:31:11,751 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:31:11,752 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:31:11,753 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:31:11,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:31:11,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:31:11,755 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:31:11,757 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:31:11,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:31:11,758 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:31:11,760 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:31:11,762 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:31:11,763 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:31:11,764 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:31:11,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:31:11,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:31:11,768 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:31:11,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:31:11,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:31:11,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:31:11,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:31:11,771 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:31:11,771 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:31:11,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:31:11,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:31:11,773 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:31:11,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:31:11,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:31:11,775 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:31:11,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:31:11,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:31:11,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:31:11,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:31:11,778 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 18:31:11,792 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:31:11,793 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:31:11,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:31:11,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:31:11,794 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:31:11,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:31:11,795 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:31:11,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:31:11,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:31:11,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:31:11,796 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:31:11,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:31:11,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:31:11,796 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:31:11,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:31:11,796 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:31:11,797 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:31:11,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:31:11,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:31:11,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:31:11,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:31:11,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:31:11,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:31:11,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:31:11,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:31:11,799 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:31:11,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:31:11,799 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:31:11,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:31:11,799 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:31:11,800 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:31:12,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:31:12,082 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:31:12,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:31:12,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:31:12,087 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:31:12,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.opt.i [2019-12-27 18:31:12,167 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128f901fa/b885b768bce94ef688ecedf084073abe/FLAGe39f85092 [2019-12-27 18:31:12,718 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:31:12,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.opt.i [2019-12-27 18:31:12,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128f901fa/b885b768bce94ef688ecedf084073abe/FLAGe39f85092 [2019-12-27 18:31:12,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128f901fa/b885b768bce94ef688ecedf084073abe [2019-12-27 18:31:12,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:31:12,996 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:31:12,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:31:12,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:31:13,000 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:31:13,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:12" (1/1) ... [2019-12-27 18:31:13,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3199e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13, skipping insertion in model container [2019-12-27 18:31:13,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:31:12" (1/1) ... [2019-12-27 18:31:13,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:31:13,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:31:13,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:31:13,631 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:31:13,699 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:31:13,778 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:31:13,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13 WrapperNode [2019-12-27 18:31:13,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:31:13,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:31:13,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:31:13,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:31:13,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,813 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:31:13,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:31:13,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:31:13,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:31:13,851 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... [2019-12-27 18:31:13,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:31:13,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:31:13,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:31:13,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:31:13,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:31:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:31:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:31:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:31:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:31:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:31:13,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:31:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:31:13,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:31:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:31:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:31:13,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:31:13,967 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 18:31:14,636 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:31:14,636 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:31:14,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:14 BoogieIcfgContainer [2019-12-27 18:31:14,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:31:14,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:31:14,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:31:14,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:31:14,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:31:12" (1/3) ... [2019-12-27 18:31:14,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4cbb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:14, skipping insertion in model container [2019-12-27 18:31:14,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:31:13" (2/3) ... [2019-12-27 18:31:14,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4cbb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:31:14, skipping insertion in model container [2019-12-27 18:31:14,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:31:14" (3/3) ... [2019-12-27 18:31:14,647 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_power.opt.i [2019-12-27 18:31:14,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:31:14,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:31:14,671 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:31:14,672 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:31:14,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,712 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,713 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,715 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,716 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,731 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,773 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,774 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,775 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,794 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,796 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,797 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,797 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,798 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,799 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,800 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,800 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,801 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:31:14,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:31:14,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:31:14,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:31:14,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:31:14,839 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:31:14,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:31:14,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:31:14,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:31:14,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:31:14,856 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 18:31:14,858 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 18:31:14,946 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 18:31:14,946 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:31:14,962 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:31:14,980 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 18:31:15,027 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 18:31:15,027 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:31:15,033 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 18:31:15,048 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 18:31:15,049 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:31:19,863 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 18:31:19,971 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 18:31:20,054 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 18:31:20,055 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 18:31:20,058 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 18:31:20,514 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 18:31:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 18:31:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:31:20,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:20,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:31:20,524 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:20,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:20,531 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 18:31:20,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:20,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342040014] [2019-12-27 18:31:20,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:31:20,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342040014] [2019-12-27 18:31:20,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:20,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:20,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1444089801] [2019-12-27 18:31:20,776 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:20,781 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:20,794 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:31:20,795 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:20,799 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:20,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:20,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:20,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:20,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:20,817 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 18:31:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:21,026 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 18:31:21,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:21,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:31:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:21,110 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 18:31:21,111 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 18:31:21,112 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 18:31:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 18:31:21,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 18:31:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 18:31:21,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 18:31:21,589 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 18:31:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:21,589 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 18:31:21,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 18:31:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:31:21,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:21,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:21,593 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 18:31:21,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:21,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588385] [2019-12-27 18:31:21,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:21,737 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 18:31:21,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588385] [2019-12-27 18:31:21,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:21,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:21,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [791384788] [2019-12-27 18:31:21,740 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:21,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:21,743 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:31:21,743 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:21,744 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:21,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:21,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:21,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:21,746 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 18:31:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:22,195 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 18:31:22,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:31:22,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:31:22,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:22,284 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 18:31:22,284 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 18:31:22,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 18:31:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 18:31:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 18:31:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 18:31:23,326 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 18:31:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:23,327 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 18:31:23,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 18:31:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:31:23,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:23,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:23,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 18:31:23,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:23,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866477629] [2019-12-27 18:31:23,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:23,488 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 18:31:23,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866477629] [2019-12-27 18:31:23,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:23,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:23,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451446453] [2019-12-27 18:31:23,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:23,493 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:23,497 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 18:31:23,497 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:23,498 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:23,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:31:23,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:31:23,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:23,499 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 18:31:23,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:23,887 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 18:31:23,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:31:23,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:31:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:23,936 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 18:31:23,936 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 18:31:23,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:24,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 18:31:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 18:31:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 18:31:24,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 18:31:24,485 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 18:31:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:24,486 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 18:31:24,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:31:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 18:31:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 18:31:24,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:24,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:24,490 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 18:31:24,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:24,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228614714] [2019-12-27 18:31:24,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:24,572 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 18:31:24,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228614714] [2019-12-27 18:31:24,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:24,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:31:24,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1154898648] [2019-12-27 18:31:24,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:24,579 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:24,582 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 18:31:24,582 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:24,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:24,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:24,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:24,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:24,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:24,584 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-27 18:31:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:24,639 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-12-27 18:31:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:24,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 18:31:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:24,668 INFO L225 Difference]: With dead ends: 11335 [2019-12-27 18:31:24,668 INFO L226 Difference]: Without dead ends: 11335 [2019-12-27 18:31:24,669 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 18:31:24,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-12-27 18:31:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-12-27 18:31:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-12-27 18:31:24,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-12-27 18:31:24,987 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-12-27 18:31:24,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:24,988 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-12-27 18:31:24,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:24,988 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-12-27 18:31:24,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 18:31:24,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:24,992 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:24,992 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:24,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:24,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-12-27 18:31:24,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:24,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819883383] [2019-12-27 18:31:24,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:25,046 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 18:31:25,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819883383] [2019-12-27 18:31:25,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:25,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:25,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [88535015] [2019-12-27 18:31:25,047 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:25,049 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:25,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 18:31:25,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:25,067 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:31:25,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:25,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:25,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:25,068 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 4 states. [2019-12-27 18:31:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:25,398 INFO L93 Difference]: Finished difference Result 18566 states and 58786 transitions. [2019-12-27 18:31:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:25,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 18:31:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:25,421 INFO L225 Difference]: With dead ends: 18566 [2019-12-27 18:31:25,421 INFO L226 Difference]: Without dead ends: 9176 [2019-12-27 18:31:25,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:25,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2019-12-27 18:31:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 9176. [2019-12-27 18:31:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2019-12-27 18:31:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 28440 transitions. [2019-12-27 18:31:25,666 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 28440 transitions. Word has length 17 [2019-12-27 18:31:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:25,666 INFO L462 AbstractCegarLoop]: Abstraction has 9176 states and 28440 transitions. [2019-12-27 18:31:25,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 28440 transitions. [2019-12-27 18:31:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 18:31:25,671 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:25,671 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:25,671 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521807, now seen corresponding path program 1 times [2019-12-27 18:31:25,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:25,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882555190] [2019-12-27 18:31:25,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:25,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:25,761 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 18:31:25,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882555190] [2019-12-27 18:31:25,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:25,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:31:25,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1490769748] [2019-12-27 18:31:25,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:25,765 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:25,769 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 18:31:25,769 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:25,772 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:31:25,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:31:25,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:25,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:31:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:31:25,774 INFO L87 Difference]: Start difference. First operand 9176 states and 28440 transitions. Second operand 4 states. [2019-12-27 18:31:25,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:25,808 INFO L93 Difference]: Finished difference Result 1638 states and 4028 transitions. [2019-12-27 18:31:25,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:31:25,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-27 18:31:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:25,811 INFO L225 Difference]: With dead ends: 1638 [2019-12-27 18:31:25,811 INFO L226 Difference]: Without dead ends: 1206 [2019-12-27 18:31:25,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:31:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2019-12-27 18:31:25,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1206. [2019-12-27 18:31:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1206 states. [2019-12-27 18:31:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 2674 transitions. [2019-12-27 18:31:25,832 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 2674 transitions. Word has length 18 [2019-12-27 18:31:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:25,832 INFO L462 AbstractCegarLoop]: Abstraction has 1206 states and 2674 transitions. [2019-12-27 18:31:25,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:31:25,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 2674 transitions. [2019-12-27 18:31:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 18:31:25,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:25,834 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] [2019-12-27 18:31:25,834 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 18:31:25,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:25,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031454573] [2019-12-27 18:31:25,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:25,926 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 18:31:25,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031454573] [2019-12-27 18:31:25,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:25,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:25,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2139604578] [2019-12-27 18:31:25,928 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:25,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:25,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 18:31:25,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:25,941 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:25,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:25,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:25,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:25,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:25,942 INFO L87 Difference]: Start difference. First operand 1206 states and 2674 transitions. Second operand 6 states. [2019-12-27 18:31:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:26,124 INFO L93 Difference]: Finished difference Result 1222 states and 2679 transitions. [2019-12-27 18:31:26,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:31:26,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 18:31:26,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:26,127 INFO L225 Difference]: With dead ends: 1222 [2019-12-27 18:31:26,127 INFO L226 Difference]: Without dead ends: 1170 [2019-12-27 18:31:26,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:31:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-27 18:31:26,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1149. [2019-12-27 18:31:26,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-12-27 18:31:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 2552 transitions. [2019-12-27 18:31:26,153 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 2552 transitions. Word has length 24 [2019-12-27 18:31:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:26,154 INFO L462 AbstractCegarLoop]: Abstraction has 1149 states and 2552 transitions. [2019-12-27 18:31:26,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:26,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 2552 transitions. [2019-12-27 18:31:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 18:31:26,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:26,156 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] [2019-12-27 18:31:26,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:26,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash -451164714, now seen corresponding path program 1 times [2019-12-27 18:31:26,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:26,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81233832] [2019-12-27 18:31:26,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:26,260 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 18:31:26,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81233832] [2019-12-27 18:31:26,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:26,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:31:26,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979806396] [2019-12-27 18:31:26,262 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:26,266 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:26,279 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 18:31:26,279 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:26,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:31:26,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:31:26,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:31:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:31:26,415 INFO L87 Difference]: Start difference. First operand 1149 states and 2552 transitions. Second operand 8 states. [2019-12-27 18:31:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:27,336 INFO L93 Difference]: Finished difference Result 1862 states and 4038 transitions. [2019-12-27 18:31:27,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:31:27,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 18:31:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:27,339 INFO L225 Difference]: With dead ends: 1862 [2019-12-27 18:31:27,339 INFO L226 Difference]: Without dead ends: 1862 [2019-12-27 18:31:27,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:31:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2019-12-27 18:31:27,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1665. [2019-12-27 18:31:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1665 states. [2019-12-27 18:31:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 3660 transitions. [2019-12-27 18:31:27,368 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 3660 transitions. Word has length 27 [2019-12-27 18:31:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:27,369 INFO L462 AbstractCegarLoop]: Abstraction has 1665 states and 3660 transitions. [2019-12-27 18:31:27,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:31:27,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 3660 transitions. [2019-12-27 18:31:27,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 18:31:27,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:27,372 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] [2019-12-27 18:31:27,372 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:27,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:27,372 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-27 18:31:27,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:27,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624251964] [2019-12-27 18:31:27,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:27,450 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 18:31:27,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624251964] [2019-12-27 18:31:27,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:27,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:31:27,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1102394425] [2019-12-27 18:31:27,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:27,455 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:27,468 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 18:31:27,468 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:27,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:31:27,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:31:27,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:27,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:31:27,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:31:27,493 INFO L87 Difference]: Start difference. First operand 1665 states and 3660 transitions. Second operand 6 states. [2019-12-27 18:31:27,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:27,538 INFO L93 Difference]: Finished difference Result 974 states and 2029 transitions. [2019-12-27 18:31:27,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:31:27,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 18:31:27,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:27,540 INFO L225 Difference]: With dead ends: 974 [2019-12-27 18:31:27,540 INFO L226 Difference]: Without dead ends: 842 [2019-12-27 18:31:27,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:31:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-12-27 18:31:27,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2019-12-27 18:31:27,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-12-27 18:31:27,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1708 transitions. [2019-12-27 18:31:27,554 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1708 transitions. Word has length 28 [2019-12-27 18:31:27,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:27,554 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1708 transitions. [2019-12-27 18:31:27,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:31:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1708 transitions. [2019-12-27 18:31:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 18:31:27,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:27,558 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] [2019-12-27 18:31:27,558 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1290466760, now seen corresponding path program 1 times [2019-12-27 18:31:27,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:27,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792575500] [2019-12-27 18:31:27,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:27,647 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 18:31:27,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792575500] [2019-12-27 18:31:27,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:27,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:31:27,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840582254] [2019-12-27 18:31:27,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:27,661 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:27,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 110 transitions. [2019-12-27 18:31:27,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:27,760 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:31:27,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:31:27,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:27,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:31:27,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:31:27,761 INFO L87 Difference]: Start difference. First operand 800 states and 1708 transitions. Second operand 9 states. [2019-12-27 18:31:28,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:28,061 INFO L93 Difference]: Finished difference Result 1394 states and 2892 transitions. [2019-12-27 18:31:28,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:31:28,061 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-12-27 18:31:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:28,063 INFO L225 Difference]: With dead ends: 1394 [2019-12-27 18:31:28,063 INFO L226 Difference]: Without dead ends: 931 [2019-12-27 18:31:28,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:31:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-27 18:31:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 792. [2019-12-27 18:31:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-27 18:31:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1676 transitions. [2019-12-27 18:31:28,074 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1676 transitions. Word has length 50 [2019-12-27 18:31:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:28,074 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1676 transitions. [2019-12-27 18:31:28,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:31:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1676 transitions. [2019-12-27 18:31:28,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 18:31:28,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:28,077 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] [2019-12-27 18:31:28,077 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:28,078 INFO L82 PathProgramCache]: Analyzing trace with hash 50774886, now seen corresponding path program 2 times [2019-12-27 18:31:28,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:28,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923258762] [2019-12-27 18:31:28,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:28,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:28,161 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 18:31:28,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923258762] [2019-12-27 18:31:28,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:28,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:28,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [217924864] [2019-12-27 18:31:28,163 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:28,259 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:28,322 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 112 transitions. [2019-12-27 18:31:28,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:28,324 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:28,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:28,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:28,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:28,325 INFO L87 Difference]: Start difference. First operand 792 states and 1676 transitions. Second operand 3 states. [2019-12-27 18:31:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:28,386 INFO L93 Difference]: Finished difference Result 1051 states and 2216 transitions. [2019-12-27 18:31:28,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:28,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-27 18:31:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:28,388 INFO L225 Difference]: With dead ends: 1051 [2019-12-27 18:31:28,388 INFO L226 Difference]: Without dead ends: 1051 [2019-12-27 18:31:28,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 18:31:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2019-12-27 18:31:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 849. [2019-12-27 18:31:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2019-12-27 18:31:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1815 transitions. [2019-12-27 18:31:28,403 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1815 transitions. Word has length 50 [2019-12-27 18:31:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:28,404 INFO L462 AbstractCegarLoop]: Abstraction has 849 states and 1815 transitions. [2019-12-27 18:31:28,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1815 transitions. [2019-12-27 18:31:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 18:31:28,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:28,407 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] [2019-12-27 18:31:28,407 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash 925752847, now seen corresponding path program 1 times [2019-12-27 18:31:28,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:28,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897512768] [2019-12-27 18:31:28,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:28,560 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 18:31:28,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897512768] [2019-12-27 18:31:28,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:28,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:31:28,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1114767989] [2019-12-27 18:31:28,561 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:28,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:28,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 84 states and 99 transitions. [2019-12-27 18:31:28,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:28,666 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:31:28,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:31:28,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:28,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:31:28,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:31:28,668 INFO L87 Difference]: Start difference. First operand 849 states and 1815 transitions. Second operand 7 states. [2019-12-27 18:31:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:29,301 INFO L93 Difference]: Finished difference Result 1004 states and 2107 transitions. [2019-12-27 18:31:29,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:31:29,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 18:31:29,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:29,304 INFO L225 Difference]: With dead ends: 1004 [2019-12-27 18:31:29,305 INFO L226 Difference]: Without dead ends: 1004 [2019-12-27 18:31:29,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:31:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2019-12-27 18:31:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 909. [2019-12-27 18:31:29,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 18:31:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1931 transitions. [2019-12-27 18:31:29,319 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1931 transitions. Word has length 51 [2019-12-27 18:31:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:29,320 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1931 transitions. [2019-12-27 18:31:29,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:31:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1931 transitions. [2019-12-27 18:31:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 18:31:29,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:29,323 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:31:29,323 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:29,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1086861075, now seen corresponding path program 2 times [2019-12-27 18:31:29,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:29,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202095638] [2019-12-27 18:31:29,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:31:29,393 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 18:31:29,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202095638] [2019-12-27 18:31:29,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:31:29,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:31:29,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1318183988] [2019-12-27 18:31:29,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:31:29,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:31:29,504 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 87 states and 113 transitions. [2019-12-27 18:31:29,505 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:31:29,505 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:31:29,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:31:29,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:31:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:31:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:31:29,506 INFO L87 Difference]: Start difference. First operand 909 states and 1931 transitions. Second operand 3 states. [2019-12-27 18:31:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:31:29,523 INFO L93 Difference]: Finished difference Result 908 states and 1929 transitions. [2019-12-27 18:31:29,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:31:29,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 18:31:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:31:29,526 INFO L225 Difference]: With dead ends: 908 [2019-12-27 18:31:29,526 INFO L226 Difference]: Without dead ends: 908 [2019-12-27 18:31:29,527 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 18:31:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-27 18:31:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 754. [2019-12-27 18:31:29,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 18:31:29,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 18:31:29,545 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 18:31:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:31:29,546 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 18:31:29,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:31:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 18:31:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 18:31:29,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:31:29,551 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 18:31:29,551 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:31:29,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:31:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 18:31:29,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:31:29,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882294587] [2019-12-27 18:31:29,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:31:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:31:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:31:29,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:31:29,788 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:31:29,792 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= v_~y$r_buff1_thd0~0_129 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2307~0.base_48|) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2307~0.base_48|) |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0)) |v_#memory_int_17|) (= 0 |v_#NULL.base_6|) (= |v_ULTIMATE.start_main_~#t2307~0.offset_31| 0) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48| 1) |v_#valid_73|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2307~0.base_48| 4)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2307~0.base_48|)) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_49|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ULTIMATE.start_main_~#t2307~0.offset=|v_ULTIMATE.start_main_~#t2307~0.offset_31|, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2307~0.base=|v_ULTIMATE.start_main_~#t2307~0.base_48|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2308~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2307~0.offset, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2307~0.base, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2308~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:31:29,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2308~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2308~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t2308~0.base_13|)) (= |v_ULTIMATE.start_main_~#t2308~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2308~0.base_13|) |v_ULTIMATE.start_main_~#t2308~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2308~0.base_13| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t2308~0.base=|v_ULTIMATE.start_main_~#t2308~0.base_13|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2308~0.offset=|v_ULTIMATE.start_main_~#t2308~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2308~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2308~0.offset] because there is no mapped edge [2019-12-27 18:31:29,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-434061599 ~y$r_buff0_thd2~0_In-434061599) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-434061599 0)) (= ~x~0_Out-434061599 1) (= ~y$r_buff0_thd1~0_Out-434061599 1) (= ~y$r_buff0_thd1~0_In-434061599 ~y$r_buff1_thd1~0_Out-434061599) (= ~y$r_buff1_thd0~0_Out-434061599 ~y$r_buff0_thd0~0_In-434061599)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-434061599, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-434061599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-434061599, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-434061599} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-434061599, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-434061599, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-434061599, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-434061599, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-434061599, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-434061599, ~x~0=~x~0_Out-434061599, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-434061599} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:31:29,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In331800674 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In331800674 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out331800674| ~y$w_buff0_used~0_In331800674)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out331800674| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In331800674, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In331800674} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out331800674|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In331800674, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In331800674} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:31:29,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-210380232 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out-210380232| ~y$w_buff0_used~0_In-210380232) (= |P1Thread1of1ForFork1_#t~ite20_In-210380232| |P1Thread1of1ForFork1_#t~ite20_Out-210380232|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-210380232| |P1Thread1of1ForFork1_#t~ite20_Out-210380232|) (= ~y$w_buff0_used~0_In-210380232 |P1Thread1of1ForFork1_#t~ite20_Out-210380232|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-210380232 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-210380232 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In-210380232 256) 0)) (= (mod ~y$w_buff0_used~0_In-210380232 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-210380232, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-210380232, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-210380232|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-210380232, ~weak$$choice2~0=~weak$$choice2~0_In-210380232, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-210380232} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-210380232, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-210380232, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-210380232|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-210380232, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-210380232|, ~weak$$choice2~0=~weak$$choice2~0_In-210380232, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-210380232} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 18:31:29,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= |P1Thread1of1ForFork1_#t~ite24_Out-883452394| |P1Thread1of1ForFork1_#t~ite23_Out-883452394|)) (.cse5 (= 0 (mod ~weak$$choice2~0_In-883452394 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-883452394 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-883452394 256) 0)) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-883452394 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-883452394 256) 0))) (or (let ((.cse1 (not .cse6))) (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-883452394|) (or .cse1 (not .cse2)) (= |P1Thread1of1ForFork1_#t~ite22_Out-883452394| |P1Thread1of1ForFork1_#t~ite23_Out-883452394|) .cse3 (or .cse1 (not .cse4)) .cse5)) (and (or (and (= |P1Thread1of1ForFork1_#t~ite23_In-883452394| |P1Thread1of1ForFork1_#t~ite23_Out-883452394|) (= |P1Thread1of1ForFork1_#t~ite24_Out-883452394| ~y$w_buff1_used~0_In-883452394) (not .cse5)) (and .cse3 .cse5 (= ~y$w_buff1_used~0_In-883452394 |P1Thread1of1ForFork1_#t~ite23_Out-883452394|) (or (and .cse2 .cse6) (and .cse6 .cse4) .cse0))) (= |P1Thread1of1ForFork1_#t~ite22_In-883452394| |P1Thread1of1ForFork1_#t~ite22_Out-883452394|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-883452394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-883452394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-883452394, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-883452394|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-883452394|, ~weak$$choice2~0=~weak$$choice2~0_In-883452394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-883452394} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-883452394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-883452394, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-883452394, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-883452394|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-883452394|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-883452394|, ~weak$$choice2~0=~weak$$choice2~0_In-883452394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-883452394} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 18:31:29,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-544619991 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-544619991 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-544619991 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-544619991 256)))) (or (and (= ~y$w_buff1_used~0_In-544619991 |P0Thread1of1ForFork0_#t~ite6_Out-544619991|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-544619991| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-544619991, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-544619991, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-544619991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544619991} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-544619991|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-544619991, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-544619991, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-544619991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544619991} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:31:29,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1690044172 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1690044172 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd1~0_In1690044172 ~y$r_buff0_thd1~0_Out1690044172)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out1690044172) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1690044172, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1690044172} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1690044172, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1690044172|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1690044172} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:31:29,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In665926914 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In665926914 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In665926914 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In665926914 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out665926914| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd1~0_In665926914 |P0Thread1of1ForFork0_#t~ite8_Out665926914|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In665926914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In665926914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In665926914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In665926914} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In665926914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In665926914, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out665926914|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In665926914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In665926914} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:31:29,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:31:29,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In138218491 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out138218491| |P1Thread1of1ForFork1_#t~ite30_Out138218491|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In138218491 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In138218491 256)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In138218491 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In138218491 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out138218491| ~y$r_buff1_thd2~0_In138218491)) (and (= |P1Thread1of1ForFork1_#t~ite29_In138218491| |P1Thread1of1ForFork1_#t~ite29_Out138218491|) (= |P1Thread1of1ForFork1_#t~ite30_Out138218491| ~y$r_buff1_thd2~0_In138218491) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In138218491, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In138218491|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In138218491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In138218491, ~weak$$choice2~0=~weak$$choice2~0_In138218491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In138218491} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In138218491, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out138218491|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out138218491|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In138218491, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In138218491, ~weak$$choice2~0=~weak$$choice2~0_In138218491, ~y$w_buff1_used~0=~y$w_buff1_used~0_In138218491} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 18:31:29,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 18:31:29,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In211933903 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In211933903 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out211933903| ~y$w_buff1~0_In211933903) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out211933903| ~y~0_In211933903) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In211933903, ~y$w_buff1~0=~y$w_buff1~0_In211933903, ~y~0=~y~0_In211933903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In211933903} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In211933903, ~y$w_buff1~0=~y$w_buff1~0_In211933903, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out211933903|, ~y~0=~y~0_In211933903, ~y$w_buff1_used~0=~y$w_buff1_used~0_In211933903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:31:29,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 18:31:29,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-735221509 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-735221509 256)))) (or (and (= ~y$w_buff0_used~0_In-735221509 |P1Thread1of1ForFork1_#t~ite34_Out-735221509|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-735221509|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-735221509, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-735221509} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-735221509, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-735221509, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-735221509|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:31:29,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1390330914 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1390330914 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1390330914 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1390330914 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out1390330914| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1390330914 |P1Thread1of1ForFork1_#t~ite35_Out1390330914|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1390330914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390330914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1390330914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390330914} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1390330914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1390330914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1390330914, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1390330914|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1390330914} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:31:29,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In356991779 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In356991779 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In356991779 |P1Thread1of1ForFork1_#t~ite36_Out356991779|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out356991779|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In356991779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In356991779} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In356991779, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In356991779, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out356991779|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:31:29,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In237937280 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In237937280 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In237937280 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In237937280 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In237937280 |P1Thread1of1ForFork1_#t~ite37_Out237937280|) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out237937280| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In237937280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In237937280, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In237937280, ~y$w_buff1_used~0=~y$w_buff1_used~0_In237937280} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In237937280, ~y$w_buff0_used~0=~y$w_buff0_used~0_In237937280, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In237937280, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out237937280|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In237937280} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:31:29,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:31:29,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:31:29,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 18:31:29,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-898420190 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-898420190 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-898420190| ~y$w_buff1~0_In-898420190) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-898420190| ~y~0_In-898420190) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-898420190, ~y~0=~y~0_In-898420190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-898420190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-898420190} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-898420190|, ~y$w_buff1~0=~y$w_buff1~0_In-898420190, ~y~0=~y~0_In-898420190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-898420190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-898420190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 18:31:29,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 18:31:29,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1534649724 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1534649724 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1534649724 |ULTIMATE.start_main_#t~ite42_Out1534649724|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out1534649724|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1534649724, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1534649724} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1534649724, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1534649724, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1534649724|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:31:29,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1862770799 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1862770799 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1862770799 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1862770799 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out1862770799|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1862770799 |ULTIMATE.start_main_#t~ite43_Out1862770799|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1862770799, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1862770799, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1862770799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1862770799} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1862770799, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1862770799, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1862770799|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1862770799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1862770799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:31:29,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1471269165 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1471269165 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1471269165 |ULTIMATE.start_main_#t~ite44_Out1471269165|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out1471269165|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1471269165, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1471269165} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1471269165, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1471269165, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1471269165|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:31:29,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In159824874 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In159824874 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In159824874 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In159824874 256)))) (or (and (= ~y$r_buff1_thd0~0_In159824874 |ULTIMATE.start_main_#t~ite45_Out159824874|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out159824874|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In159824874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In159824874, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In159824874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159824874} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In159824874, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In159824874, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In159824874, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out159824874|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159824874} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:31:29,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:31:29,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:31:29 BasicIcfg [2019-12-27 18:31:29,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:31:29,893 INFO L168 Benchmark]: Toolchain (without parser) took 16896.94 ms. Allocated memory was 137.9 MB in the beginning and 689.4 MB in the end (delta: 551.6 MB). Free memory was 101.1 MB in the beginning and 488.4 MB in the end (delta: -387.4 MB). Peak memory consumption was 545.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:29,894 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:31:29,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 782.77 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 156.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:29,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.62 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:29,897 INFO L168 Benchmark]: Boogie Preprocessor took 36.69 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:29,898 INFO L168 Benchmark]: RCFGBuilder took 758.02 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 107.4 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:29,899 INFO L168 Benchmark]: TraceAbstraction took 15251.26 ms. Allocated memory was 202.4 MB in the beginning and 689.4 MB in the end (delta: 487.1 MB). Free memory was 107.4 MB in the beginning and 488.4 MB in the end (delta: -381.1 MB). Peak memory consumption was 487.5 MB. Max. memory is 7.1 GB. [2019-12-27 18:31:29,909 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.19 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 782.77 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 156.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.62 ms. Allocated memory is still 202.4 MB. Free memory was 156.0 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.69 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 758.02 ms. Allocated memory is still 202.4 MB. Free memory was 151.1 MB in the beginning and 107.4 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15251.26 ms. Allocated memory was 202.4 MB in the beginning and 689.4 MB in the end (delta: 487.1 MB). Free memory was 107.4 MB in the beginning and 488.4 MB in the end (delta: -381.1 MB). Peak memory consumption was 487.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2307, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2308, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1459 SDtfs, 1641 SDslu, 3288 SDs, 0 SdLazy, 1922 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 5169 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 412 NumberOfCodeBlocks, 412 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 347 ConstructedInterpolants, 0 QuantifiedInterpolants, 37039 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...