/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:37:38,680 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:37:38,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:37:38,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:37:38,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:37:38,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:37:38,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:37:38,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:37:38,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:37:38,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:37:38,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:37:38,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:37:38,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:37:38,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:37:38,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:37:38,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:37:38,710 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:37:38,714 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:37:38,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:37:38,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:37:38,727 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:37:38,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:37:38,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:37:38,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:37:38,737 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:37:38,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:37:38,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:37:38,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:37:38,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:37:38,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:37:38,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:37:38,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:37:38,742 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:37:38,743 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:37:38,744 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:37:38,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:37:38,744 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:37:38,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:37:38,745 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:37:38,746 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:37:38,746 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:37:38,747 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:37:38,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:37:38,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:37:38,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:37:38,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:37:38,763 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:37:38,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:37:38,764 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:37:38,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:37:38,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:37:38,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:37:38,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:37:38,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:37:38,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:37:38,765 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:37:38,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:37:38,765 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:37:38,765 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:37:38,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:37:38,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:37:38,766 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:37:38,766 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:37:38,766 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:37:38,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:37:38,767 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:37:38,767 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:37:38,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:37:38,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:37:38,768 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:37:38,768 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:37:38,768 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:37:39,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:37:39,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:37:39,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:37:39,064 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:37:39,065 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:37:39,066 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-18 14:37:39,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2149d4072/4d03635a76504e8b9f3b6c639ce2e1ac/FLAGec4ef8a17 [2019-12-18 14:37:39,733 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:37:39,734 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.opt.i [2019-12-18 14:37:39,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2149d4072/4d03635a76504e8b9f3b6c639ce2e1ac/FLAGec4ef8a17 [2019-12-18 14:37:40,060 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2149d4072/4d03635a76504e8b9f3b6c639ce2e1ac [2019-12-18 14:37:40,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:37:40,071 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:37:40,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:37:40,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:37:40,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:37:40,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217be98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40, skipping insertion in model container [2019-12-18 14:37:40,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:37:40,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:37:40,618 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:37:40,631 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:37:40,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:37:40,778 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:37:40,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40 WrapperNode [2019-12-18 14:37:40,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:37:40,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:37:40,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:37:40,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:37:40,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:37:40,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:37:40,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:37:40,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:37:40,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,866 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,881 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,885 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (1/1) ... [2019-12-18 14:37:40,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:37:40,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:37:40,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:37:40,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:37:40,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (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-18 14:37:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:37:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:37:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:37:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:37:40,973 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:37:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:37:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:37:40,974 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:37:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:37:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:37:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:37:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:37:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:37:40,977 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:37:41,688 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:37:41,688 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:37:41,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:37:41 BoogieIcfgContainer [2019-12-18 14:37:41,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:37:41,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:37:41,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:37:41,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:37:41,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:37:40" (1/3) ... [2019-12-18 14:37:41,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ea52a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:37:41, skipping insertion in model container [2019-12-18 14:37:41,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:37:40" (2/3) ... [2019-12-18 14:37:41,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ea52a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:37:41, skipping insertion in model container [2019-12-18 14:37:41,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:37:41" (3/3) ... [2019-12-18 14:37:41,703 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2019-12-18 14:37:41,715 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:37:41,716 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:37:41,728 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:37:41,730 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:37:41,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,793 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,794 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,795 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,807 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,807 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,847 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,847 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,859 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,862 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,863 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,863 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,864 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,866 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,867 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:37:41,883 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:37:41,903 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:37:41,903 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:37:41,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:37:41,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:37:41,904 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:37:41,904 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:37:41,904 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:37:41,904 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:37:41,923 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 14:37:41,926 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:37:42,045 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:37:42,045 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:37:42,064 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:37:42,093 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:37:42,151 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:37:42,151 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:37:42,164 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:37:42,190 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 14:37:42,192 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:37:47,347 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 14:37:47,664 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:37:47,771 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:37:47,798 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-18 14:37:47,798 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 14:37:47,802 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-18 14:38:02,284 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-18 14:38:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-18 14:38:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:38:02,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:02,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:38:02,295 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-18 14:38:02,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:02,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246389563] [2019-12-18 14:38:02,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:02,544 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-18 14:38:02,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246389563] [2019-12-18 14:38:02,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:02,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:38:02,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992924702] [2019-12-18 14:38:02,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:02,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:02,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:02,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:02,576 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-18 14:38:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:05,208 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-18 14:38:05,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:05,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:38:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:06,017 INFO L225 Difference]: With dead ends: 104560 [2019-12-18 14:38:06,018 INFO L226 Difference]: Without dead ends: 102376 [2019-12-18 14:38:06,019 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-18 14:38:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-18 14:38:13,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-18 14:38:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-18 14:38:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-18 14:38:17,726 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-18 14:38:17,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:17,726 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-18 14:38:17,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:17,726 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-18 14:38:17,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:38:17,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:17,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:17,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:17,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:17,732 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-18 14:38:17,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:17,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701940857] [2019-12-18 14:38:17,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:17,880 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-18 14:38:17,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701940857] [2019-12-18 14:38:17,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:17,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:17,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910630846] [2019-12-18 14:38:17,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:38:17,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:38:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:38:17,883 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-18 14:38:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:23,507 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-18 14:38:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:38:23,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:38:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:24,094 INFO L225 Difference]: With dead ends: 164490 [2019-12-18 14:38:24,094 INFO L226 Difference]: Without dead ends: 164441 [2019-12-18 14:38:24,095 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-18 14:38:28,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-18 14:38:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-18 14:38:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-18 14:38:32,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-18 14:38:32,319 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-18 14:38:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:32,319 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-18 14:38:32,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:38:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-18 14:38:32,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:38:32,325 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:32,325 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:32,325 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:32,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:32,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-18 14:38:32,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:32,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780268948] [2019-12-18 14:38:32,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:32,433 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-18 14:38:32,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780268948] [2019-12-18 14:38:32,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:32,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:32,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467709297] [2019-12-18 14:38:32,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:38:32,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:38:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:38:32,435 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-18 14:38:38,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:38,881 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-18 14:38:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:38:38,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:38:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:39,710 INFO L225 Difference]: With dead ends: 211896 [2019-12-18 14:38:39,710 INFO L226 Difference]: Without dead ends: 211833 [2019-12-18 14:38:39,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:45,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-18 14:38:48,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-18 14:38:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-18 14:38:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-18 14:38:49,261 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-18 14:38:49,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:49,262 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-18 14:38:49,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:38:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-18 14:38:49,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:38:49,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:49,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:49,266 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:49,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:49,267 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-18 14:38:49,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:49,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372815522] [2019-12-18 14:38:49,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:49,309 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-18 14:38:49,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372815522] [2019-12-18 14:38:49,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:49,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:38:49,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814084881] [2019-12-18 14:38:49,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:49,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:49,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:49,311 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-18 14:38:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:49,452 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-18 14:38:49,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:49,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:38:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:49,525 INFO L225 Difference]: With dead ends: 36088 [2019-12-18 14:38:49,525 INFO L226 Difference]: Without dead ends: 36088 [2019-12-18 14:38:49,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:49,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-18 14:38:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-18 14:38:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-18 14:38:55,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-18 14:38:55,632 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-18 14:38:55,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:55,633 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-18 14:38:55,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-18 14:38:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:38:55,636 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:55,636 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:55,637 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:55,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:55,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-18 14:38:55,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:55,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640166192] [2019-12-18 14:38:55,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:55,714 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-18 14:38:55,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640166192] [2019-12-18 14:38:55,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:55,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:55,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978907123] [2019-12-18 14:38:55,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:55,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:55,716 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 5 states. [2019-12-18 14:38:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:56,434 INFO L93 Difference]: Finished difference Result 49088 states and 156546 transitions. [2019-12-18 14:38:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:38:56,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:38:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:56,511 INFO L225 Difference]: With dead ends: 49088 [2019-12-18 14:38:56,511 INFO L226 Difference]: Without dead ends: 49075 [2019-12-18 14:38:56,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:38:56,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49075 states. [2019-12-18 14:38:57,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49075 to 36431. [2019-12-18 14:38:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-18 14:38:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-18 14:38:57,582 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-18 14:38:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:57,582 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-18 14:38:57,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-18 14:38:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:38:57,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:57,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:57,596 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:57,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-18 14:38:57,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:57,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330321397] [2019-12-18 14:38:57,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:57,695 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-18 14:38:57,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330321397] [2019-12-18 14:38:57,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:57,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:57,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408835447] [2019-12-18 14:38:57,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:38:57,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:57,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:38:57,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:38:57,698 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-18 14:38:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:57,737 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-18 14:38:57,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:38:57,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:38:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:57,749 INFO L225 Difference]: With dead ends: 7050 [2019-12-18 14:38:57,749 INFO L226 Difference]: Without dead ends: 7050 [2019-12-18 14:38:57,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:38:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-18 14:38:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-18 14:38:57,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-18 14:38:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-18 14:38:57,837 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-18 14:38:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:57,837 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-18 14:38:57,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:38:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-18 14:38:57,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:38:57,848 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:57,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:57,849 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:57,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:57,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-18 14:38:57,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:57,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719090625] [2019-12-18 14:38:57,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:57,927 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-18 14:38:57,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719090625] [2019-12-18 14:38:57,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:57,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:38:57,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906086727] [2019-12-18 14:38:57,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:57,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:57,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:57,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:57,929 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-18 14:38:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:57,966 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-18 14:38:57,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:38:57,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:38:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:57,974 INFO L225 Difference]: With dead ends: 5023 [2019-12-18 14:38:57,974 INFO L226 Difference]: Without dead ends: 5023 [2019-12-18 14:38:57,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-18 14:38:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-18 14:38:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-18 14:38:58,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-18 14:38:58,043 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-18 14:38:58,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:58,043 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-18 14:38:58,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:58,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-18 14:38:58,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:58,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:58,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:58,051 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:58,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-18 14:38:58,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:58,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747890705] [2019-12-18 14:38:58,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:58,123 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-18 14:38:58,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747890705] [2019-12-18 14:38:58,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:58,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:58,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667888180] [2019-12-18 14:38:58,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:58,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:58,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:58,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:58,126 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:38:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:58,179 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-18 14:38:58,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:58,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:38:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:58,187 INFO L225 Difference]: With dead ends: 4668 [2019-12-18 14:38:58,188 INFO L226 Difference]: Without dead ends: 4668 [2019-12-18 14:38:58,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:58,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-18 14:38:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-18 14:38:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-18 14:38:58,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-18 14:38:58,253 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-18 14:38:58,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:58,253 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-18 14:38:58,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:58,253 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-18 14:38:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:58,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:58,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:58,260 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:58,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-18 14:38:58,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:58,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742584098] [2019-12-18 14:38:58,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:58,329 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-18 14:38:58,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742584098] [2019-12-18 14:38:58,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:58,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:38:58,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268985459] [2019-12-18 14:38:58,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:38:58,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:38:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:58,333 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-18 14:38:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:58,382 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-18 14:38:58,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:38:58,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:38:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:58,389 INFO L225 Difference]: With dead ends: 4668 [2019-12-18 14:38:58,389 INFO L226 Difference]: Without dead ends: 4668 [2019-12-18 14:38:58,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:38:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-18 14:38:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-18 14:38:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-18 14:38:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-18 14:38:58,451 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-18 14:38:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:58,452 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-18 14:38:58,452 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:38:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-18 14:38:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:58,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:58,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:58,458 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-18 14:38:58,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:58,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521858334] [2019-12-18 14:38:58,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:58,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-18 14:38:58,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521858334] [2019-12-18 14:38:58,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:58,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:38:58,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213888546] [2019-12-18 14:38:58,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:58,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:58,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:58,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:58,575 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-18 14:38:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:58,888 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-18 14:38:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:38:58,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:38:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:58,900 INFO L225 Difference]: With dead ends: 7088 [2019-12-18 14:38:58,900 INFO L226 Difference]: Without dead ends: 7088 [2019-12-18 14:38:58,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:38:58,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-18 14:38:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-18 14:38:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-18 14:38:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-18 14:38:58,995 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-18 14:38:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:58,995 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-18 14:38:58,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-18 14:38:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:59,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:59,003 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:59,004 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:59,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:59,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-18 14:38:59,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:59,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102904047] [2019-12-18 14:38:59,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:59,132 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-18 14:38:59,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102904047] [2019-12-18 14:38:59,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:59,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:38:59,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817733360] [2019-12-18 14:38:59,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:38:59,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:38:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:38:59,135 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 5 states. [2019-12-18 14:38:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:38:59,488 INFO L93 Difference]: Finished difference Result 9067 states and 25836 transitions. [2019-12-18 14:38:59,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:38:59,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:38:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:38:59,501 INFO L225 Difference]: With dead ends: 9067 [2019-12-18 14:38:59,501 INFO L226 Difference]: Without dead ends: 9067 [2019-12-18 14:38:59,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:38:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9067 states. [2019-12-18 14:38:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9067 to 6731. [2019-12-18 14:38:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6731 states. [2019-12-18 14:38:59,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6731 states to 6731 states and 19498 transitions. [2019-12-18 14:38:59,603 INFO L78 Accepts]: Start accepts. Automaton has 6731 states and 19498 transitions. Word has length 65 [2019-12-18 14:38:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:38:59,604 INFO L462 AbstractCegarLoop]: Abstraction has 6731 states and 19498 transitions. [2019-12-18 14:38:59,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:38:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 6731 states and 19498 transitions. [2019-12-18 14:38:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:38:59,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:38:59,614 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:38:59,614 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:38:59,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:38:59,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1650424373, now seen corresponding path program 3 times [2019-12-18 14:38:59,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:38:59,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242715823] [2019-12-18 14:38:59,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:38:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:38:59,712 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-18 14:38:59,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242715823] [2019-12-18 14:38:59,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:38:59,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:38:59,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780705863] [2019-12-18 14:38:59,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:38:59,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:38:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:38:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:38:59,714 INFO L87 Difference]: Start difference. First operand 6731 states and 19498 transitions. Second operand 6 states. [2019-12-18 14:39:00,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:00,194 INFO L93 Difference]: Finished difference Result 10883 states and 31287 transitions. [2019-12-18 14:39:00,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:39:00,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 14:39:00,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:00,213 INFO L225 Difference]: With dead ends: 10883 [2019-12-18 14:39:00,213 INFO L226 Difference]: Without dead ends: 10883 [2019-12-18 14:39:00,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:39:00,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-12-18 14:39:00,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7254. [2019-12-18 14:39:00,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7254 states. [2019-12-18 14:39:00,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7254 states to 7254 states and 21077 transitions. [2019-12-18 14:39:00,642 INFO L78 Accepts]: Start accepts. Automaton has 7254 states and 21077 transitions. Word has length 65 [2019-12-18 14:39:00,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:00,642 INFO L462 AbstractCegarLoop]: Abstraction has 7254 states and 21077 transitions. [2019-12-18 14:39:00,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:39:00,642 INFO L276 IsEmpty]: Start isEmpty. Operand 7254 states and 21077 transitions. [2019-12-18 14:39:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:39:00,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:00,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:00,656 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:00,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2063456247, now seen corresponding path program 4 times [2019-12-18 14:39:00,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:00,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546379677] [2019-12-18 14:39:00,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:00,767 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-18 14:39:00,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546379677] [2019-12-18 14:39:00,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:00,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:00,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498902538] [2019-12-18 14:39:00,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:00,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:00,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:00,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:00,772 INFO L87 Difference]: Start difference. First operand 7254 states and 21077 transitions. Second operand 3 states. [2019-12-18 14:39:00,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:00,809 INFO L93 Difference]: Finished difference Result 6359 states and 18151 transitions. [2019-12-18 14:39:00,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:00,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:39:00,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:00,819 INFO L225 Difference]: With dead ends: 6359 [2019-12-18 14:39:00,819 INFO L226 Difference]: Without dead ends: 6359 [2019-12-18 14:39:00,821 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-18 14:39:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6359 states. [2019-12-18 14:39:00,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6359 to 5907. [2019-12-18 14:39:00,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5907 states. [2019-12-18 14:39:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5907 states to 5907 states and 16891 transitions. [2019-12-18 14:39:00,948 INFO L78 Accepts]: Start accepts. Automaton has 5907 states and 16891 transitions. Word has length 65 [2019-12-18 14:39:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:00,949 INFO L462 AbstractCegarLoop]: Abstraction has 5907 states and 16891 transitions. [2019-12-18 14:39:00,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 5907 states and 16891 transitions. [2019-12-18 14:39:00,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:39:00,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:00,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:00,964 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1505088197, now seen corresponding path program 1 times [2019-12-18 14:39:00,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:00,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431888812] [2019-12-18 14:39:00,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:01,110 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-18 14:39:01,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431888812] [2019-12-18 14:39:01,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:01,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:39:01,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337986262] [2019-12-18 14:39:01,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:39:01,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:01,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:39:01,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:39:01,112 INFO L87 Difference]: Start difference. First operand 5907 states and 16891 transitions. Second operand 6 states. [2019-12-18 14:39:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:01,625 INFO L93 Difference]: Finished difference Result 8582 states and 24149 transitions. [2019-12-18 14:39:01,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:39:01,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 14:39:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:01,636 INFO L225 Difference]: With dead ends: 8582 [2019-12-18 14:39:01,636 INFO L226 Difference]: Without dead ends: 8582 [2019-12-18 14:39:01,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:39:01,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8582 states. [2019-12-18 14:39:01,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8582 to 6150. [2019-12-18 14:39:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6150 states. [2019-12-18 14:39:01,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 17588 transitions. [2019-12-18 14:39:01,733 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 17588 transitions. Word has length 66 [2019-12-18 14:39:01,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:01,733 INFO L462 AbstractCegarLoop]: Abstraction has 6150 states and 17588 transitions. [2019-12-18 14:39:01,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:39:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 17588 transitions. [2019-12-18 14:39:01,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:39:01,742 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:01,742 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:01,742 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:01,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash 924001521, now seen corresponding path program 2 times [2019-12-18 14:39:01,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:01,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190857226] [2019-12-18 14:39:01,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:01,806 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-18 14:39:01,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190857226] [2019-12-18 14:39:01,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:01,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:01,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534156141] [2019-12-18 14:39:01,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:01,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:01,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:01,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:01,809 INFO L87 Difference]: Start difference. First operand 6150 states and 17588 transitions. Second operand 3 states. [2019-12-18 14:39:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:01,837 INFO L93 Difference]: Finished difference Result 5729 states and 16070 transitions. [2019-12-18 14:39:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:01,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:39:01,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:01,846 INFO L225 Difference]: With dead ends: 5729 [2019-12-18 14:39:01,846 INFO L226 Difference]: Without dead ends: 5729 [2019-12-18 14:39:01,848 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-18 14:39:01,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5729 states. [2019-12-18 14:39:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5729 to 5729. [2019-12-18 14:39:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5729 states. [2019-12-18 14:39:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5729 states to 5729 states and 16070 transitions. [2019-12-18 14:39:01,950 INFO L78 Accepts]: Start accepts. Automaton has 5729 states and 16070 transitions. Word has length 66 [2019-12-18 14:39:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:01,950 INFO L462 AbstractCegarLoop]: Abstraction has 5729 states and 16070 transitions. [2019-12-18 14:39:01,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5729 states and 16070 transitions. [2019-12-18 14:39:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:39:01,964 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:01,964 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:01,964 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:01,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 184206773, now seen corresponding path program 1 times [2019-12-18 14:39:01,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:01,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205547873] [2019-12-18 14:39:01,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:02,082 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-18 14:39:02,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205547873] [2019-12-18 14:39:02,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:02,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:39:02,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228871263] [2019-12-18 14:39:02,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:39:02,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:39:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:39:02,084 INFO L87 Difference]: Start difference. First operand 5729 states and 16070 transitions. Second operand 8 states. [2019-12-18 14:39:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:03,094 INFO L93 Difference]: Finished difference Result 7774 states and 21607 transitions. [2019-12-18 14:39:03,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 14:39:03,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-18 14:39:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:03,105 INFO L225 Difference]: With dead ends: 7774 [2019-12-18 14:39:03,105 INFO L226 Difference]: Without dead ends: 7774 [2019-12-18 14:39:03,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:39:03,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7774 states. [2019-12-18 14:39:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7774 to 5617. [2019-12-18 14:39:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5617 states. [2019-12-18 14:39:03,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5617 states to 5617 states and 15756 transitions. [2019-12-18 14:39:03,193 INFO L78 Accepts]: Start accepts. Automaton has 5617 states and 15756 transitions. Word has length 67 [2019-12-18 14:39:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:03,194 INFO L462 AbstractCegarLoop]: Abstraction has 5617 states and 15756 transitions. [2019-12-18 14:39:03,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:39:03,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5617 states and 15756 transitions. [2019-12-18 14:39:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:39:03,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:03,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:03,200 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash -437783823, now seen corresponding path program 2 times [2019-12-18 14:39:03,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:03,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249712414] [2019-12-18 14:39:03,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:03,487 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-18 14:39:03,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249712414] [2019-12-18 14:39:03,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:03,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:39:03,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449770495] [2019-12-18 14:39:03,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:39:03,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:03,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:39:03,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:39:03,489 INFO L87 Difference]: Start difference. First operand 5617 states and 15756 transitions. Second operand 14 states. [2019-12-18 14:39:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:04,383 INFO L93 Difference]: Finished difference Result 14159 states and 39892 transitions. [2019-12-18 14:39:04,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 14:39:04,383 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-18 14:39:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:04,393 INFO L225 Difference]: With dead ends: 14159 [2019-12-18 14:39:04,393 INFO L226 Difference]: Without dead ends: 6995 [2019-12-18 14:39:04,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2019-12-18 14:39:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2019-12-18 14:39:04,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 5233. [2019-12-18 14:39:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5233 states. [2019-12-18 14:39:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 14654 transitions. [2019-12-18 14:39:04,648 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 14654 transitions. Word has length 67 [2019-12-18 14:39:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:04,649 INFO L462 AbstractCegarLoop]: Abstraction has 5233 states and 14654 transitions. [2019-12-18 14:39:04,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:39:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 14654 transitions. [2019-12-18 14:39:04,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:39:04,654 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:04,654 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:04,654 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:04,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1491317033, now seen corresponding path program 3 times [2019-12-18 14:39:04,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:04,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135621013] [2019-12-18 14:39:04,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:04,714 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-18 14:39:04,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135621013] [2019-12-18 14:39:04,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:04,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:39:04,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611261074] [2019-12-18 14:39:04,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:39:04,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:04,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:39:04,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:39:04,716 INFO L87 Difference]: Start difference. First operand 5233 states and 14654 transitions. Second operand 3 states. [2019-12-18 14:39:04,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:04,761 INFO L93 Difference]: Finished difference Result 5233 states and 14653 transitions. [2019-12-18 14:39:04,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:39:04,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:39:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:04,769 INFO L225 Difference]: With dead ends: 5233 [2019-12-18 14:39:04,769 INFO L226 Difference]: Without dead ends: 5233 [2019-12-18 14:39:04,770 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-18 14:39:04,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2019-12-18 14:39:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 2810. [2019-12-18 14:39:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-18 14:39:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 7919 transitions. [2019-12-18 14:39:04,835 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 7919 transitions. Word has length 67 [2019-12-18 14:39:04,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:04,835 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 7919 transitions. [2019-12-18 14:39:04,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:39:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 7919 transitions. [2019-12-18 14:39:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:39:04,838 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:04,838 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:04,838 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:04,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:04,838 INFO L82 PathProgramCache]: Analyzing trace with hash -829052917, now seen corresponding path program 1 times [2019-12-18 14:39:04,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:04,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75376572] [2019-12-18 14:39:04,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:39:05,040 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-18 14:39:05,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75376572] [2019-12-18 14:39:05,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:39:05,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 14:39:05,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565364059] [2019-12-18 14:39:05,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 14:39:05,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:39:05,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 14:39:05,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:39:05,042 INFO L87 Difference]: Start difference. First operand 2810 states and 7919 transitions. Second operand 14 states. [2019-12-18 14:39:05,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:39:05,724 INFO L93 Difference]: Finished difference Result 5013 states and 13937 transitions. [2019-12-18 14:39:05,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 14:39:05,724 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 14:39:05,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:39:05,732 INFO L225 Difference]: With dead ends: 5013 [2019-12-18 14:39:05,732 INFO L226 Difference]: Without dead ends: 4983 [2019-12-18 14:39:05,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-18 14:39:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-12-18 14:39:05,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 4062. [2019-12-18 14:39:05,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2019-12-18 14:39:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 11305 transitions. [2019-12-18 14:39:05,790 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 11305 transitions. Word has length 68 [2019-12-18 14:39:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:39:05,790 INFO L462 AbstractCegarLoop]: Abstraction has 4062 states and 11305 transitions. [2019-12-18 14:39:05,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 14:39:05,790 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 11305 transitions. [2019-12-18 14:39:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:39:05,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:39:05,794 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:39:05,794 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:39:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:39:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 2 times [2019-12-18 14:39:05,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:39:05,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895206922] [2019-12-18 14:39:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:39:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:39:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:39:05,908 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:39:05,908 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:39:05,912 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2040~0.base_21|) (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2040~0.base_21| 4)) (= v_~z$r_buff1_thd0~0_308 0) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0) (= v_~main$tmp_guard0~0_21 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2040~0.base_21|) |v_ULTIMATE.start_main_~#t2040~0.offset_17| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_109 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21| 1)) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2040~0.base_21|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_17|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ULTIMATE.start_main_~#t2040~0.base=|v_ULTIMATE.start_main_~#t2040~0.base_21|, ~x~0=v_~x~0_138, ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_16|, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_20|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_~#t2040~0.offset=|v_ULTIMATE.start_main_~#t2040~0.offset_17|, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t2041~0.offset, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2041~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2040~0.base, ~x~0, ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2040~0.offset, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:39:05,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2041~0.base_12|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12|)) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2041~0.base_12|) |v_ULTIMATE.start_main_~#t2041~0.offset_11| 1))) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2041~0.base_12| 4)) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2041~0.base_12| 1)) (= 0 |v_ULTIMATE.start_main_~#t2041~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2041~0.offset=|v_ULTIMATE.start_main_~#t2041~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2041~0.base=|v_ULTIMATE.start_main_~#t2041~0.base_12|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2041~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2041~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 14:39:05,913 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:39:05,915 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2042~0.base_9|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2042~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2042~0.base_9|)) (not (= |v_ULTIMATE.start_main_~#t2042~0.base_9| 0)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2042~0.base_9|) |v_ULTIMATE.start_main_~#t2042~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t2042~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2042~0.offset=|v_ULTIMATE.start_main_~#t2042~0.offset_8|, ULTIMATE.start_main_~#t2042~0.base=|v_ULTIMATE.start_main_~#t2042~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2042~0.offset, ULTIMATE.start_main_~#t2042~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 14:39:05,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1237461396 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1237461396 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1237461396| 0)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1237461396| ~z$w_buff0_used~0_In-1237461396) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237461396, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1237461396} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1237461396|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1237461396, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1237461396} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:39:05,916 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1042985550 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1042985550 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1042985550 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-1042985550 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1042985550| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1042985550| ~z$w_buff1_used~0_In-1042985550) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042985550, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1042985550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042985550, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1042985550} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1042985550|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1042985550, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1042985550, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1042985550, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1042985550} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:39:05,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-2093104749 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2093104749 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-2093104749 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_Out-2093104749 ~z$r_buff0_thd1~0_In-2093104749) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2093104749, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-2093104749} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2093104749, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2093104749|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-2093104749} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:39:05,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1995148322 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1995148322 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In1995148322 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1995148322 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out1995148322| 0)) (and (= ~z$r_buff1_thd1~0_In1995148322 |P0Thread1of1ForFork0_#t~ite8_Out1995148322|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1995148322, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1995148322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1995148322, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1995148322} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1995148322, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1995148322|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1995148322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1995148322, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1995148322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:39:05,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:39:05,919 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd2~0_In-38904372 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-38904372 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite9_Out-38904372| |P1Thread1of1ForFork1_#t~ite10_Out-38904372|))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-38904372 |P1Thread1of1ForFork1_#t~ite9_Out-38904372|) .cse2) (and (or .cse0 .cse1) (= ~z~0_In-38904372 |P1Thread1of1ForFork1_#t~ite9_Out-38904372|) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-38904372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-38904372, ~z$w_buff1~0=~z$w_buff1~0_In-38904372, ~z~0=~z~0_In-38904372} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-38904372|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-38904372, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-38904372, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-38904372|, ~z$w_buff1~0=~z$w_buff1~0_In-38904372, ~z~0=~z~0_In-38904372} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 14:39:05,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-728543171 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-728543171 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-728543171| ~z~0_In-728543171) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-728543171| ~z$w_buff1~0_In-728543171) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-728543171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-728543171, ~z$w_buff1~0=~z$w_buff1~0_In-728543171, ~z~0=~z~0_In-728543171} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-728543171|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-728543171, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-728543171, ~z$w_buff1~0=~z$w_buff1~0_In-728543171, ~z~0=~z~0_In-728543171} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:39:05,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 14:39:05,921 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1931449521 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1931449521 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1931449521| ~z$w_buff0_used~0_In1931449521)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1931449521| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1931449521, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1931449521} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1931449521, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1931449521, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1931449521|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:39:05,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1939457594 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1939457594 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1939457594 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1939457594 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1939457594 |P2Thread1of1ForFork2_#t~ite18_Out1939457594|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite18_Out1939457594| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1939457594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1939457594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1939457594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1939457594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1939457594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1939457594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1939457594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1939457594, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1939457594|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:39:05,922 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1317810065 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1317810065 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite19_Out-1317810065|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd3~0_In-1317810065 |P2Thread1of1ForFork2_#t~ite19_Out-1317810065|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1317810065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1317810065} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1317810065, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1317810065, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1317810065|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:39:05,923 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-1166078283 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1166078283 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1166078283 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1166078283 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1166078283 |P2Thread1of1ForFork2_#t~ite20_Out-1166078283|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1166078283|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166078283, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1166078283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166078283, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1166078283} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1166078283, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1166078283|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1166078283, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1166078283, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1166078283} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:39:05,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:39:05,924 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In965008675 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In965008675 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out965008675| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out965008675| ~z$w_buff0_used~0_In965008675) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In965008675, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In965008675} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In965008675, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out965008675|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In965008675} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:39:05,925 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-758054196 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-758054196 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-758054196 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-758054196 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-758054196|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-758054196 |P1Thread1of1ForFork1_#t~ite12_Out-758054196|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-758054196, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-758054196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-758054196, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-758054196} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-758054196, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-758054196, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-758054196, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-758054196|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-758054196} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:39:05,926 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In1622841286 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1622841286 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out1622841286| ~z$r_buff0_thd2~0_In1622841286)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1622841286| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1622841286, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1622841286} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1622841286, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1622841286|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1622841286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:39:05,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-283583271 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-283583271 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-283583271 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In-283583271 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-283583271|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In-283583271 |P1Thread1of1ForFork1_#t~ite14_Out-283583271|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-283583271, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-283583271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283583271, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-283583271} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-283583271, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-283583271, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-283583271, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-283583271|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-283583271} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:39:05,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:39:05,927 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:39:05,928 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite24_Out-422126080| |ULTIMATE.start_main_#t~ite25_Out-422126080|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-422126080 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-422126080 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite24_Out-422126080| ~z~0_In-422126080)) (and .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out-422126080| ~z$w_buff1~0_In-422126080) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-422126080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-422126080, ~z$w_buff1~0=~z$w_buff1~0_In-422126080, ~z~0=~z~0_In-422126080} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-422126080, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-422126080|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-422126080, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-422126080|, ~z$w_buff1~0=~z$w_buff1~0_In-422126080, ~z~0=~z~0_In-422126080} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 14:39:05,929 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2119788626 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In2119788626 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite26_Out2119788626| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite26_Out2119788626| ~z$w_buff0_used~0_In2119788626)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2119788626, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2119788626} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2119788626, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2119788626, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out2119788626|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:39:05,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-652003509 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-652003509 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-652003509 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-652003509 256)))) (or (and (= ~z$w_buff1_used~0_In-652003509 |ULTIMATE.start_main_#t~ite27_Out-652003509|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-652003509|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-652003509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-652003509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-652003509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-652003509} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-652003509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-652003509, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-652003509, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-652003509, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-652003509|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:39:05,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1268889409 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1268889409 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1268889409| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite28_Out1268889409| ~z$r_buff0_thd0~0_In1268889409)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1268889409, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1268889409} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1268889409, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1268889409|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1268889409} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:39:05,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1583003699 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1583003699 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1583003699 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1583003699 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out1583003699| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd0~0_In1583003699 |ULTIMATE.start_main_#t~ite29_Out1583003699|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1583003699, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1583003699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1583003699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1583003699} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1583003699, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1583003699|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1583003699, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1583003699, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1583003699} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:39:05,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:39:05,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:39:05,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:39:06,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:39:06 BasicIcfg [2019-12-18 14:39:06,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:39:06,059 INFO L168 Benchmark]: Toolchain (without parser) took 85988.59 ms. Allocated memory was 145.2 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 101.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:39:06,060 INFO L168 Benchmark]: CDTParser took 1.80 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:39:06,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.03 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.8 MB in the beginning and 154.7 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:39:06,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.92 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:39:06,062 INFO L168 Benchmark]: Boogie Preprocessor took 41.70 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:39:06,065 INFO L168 Benchmark]: RCFGBuilder took 799.75 ms. Allocated memory is still 201.9 MB. Free memory was 149.4 MB in the beginning and 99.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:39:06,066 INFO L168 Benchmark]: TraceAbstraction took 84363.76 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-18 14:39:06,069 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.80 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.03 ms. Allocated memory was 145.2 MB in the beginning and 201.9 MB in the end (delta: 56.6 MB). Free memory was 100.8 MB in the beginning and 154.7 MB in the end (delta: -53.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.92 ms. Allocated memory is still 201.9 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.70 ms. Allocated memory is still 201.9 MB. Free memory was 152.1 MB in the beginning and 149.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.75 ms. Allocated memory is still 201.9 MB. Free memory was 149.4 MB in the beginning and 99.9 MB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 84363.76 ms. Allocated memory was 201.9 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 99.3 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 84.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2932 SDtfs, 2638 SDslu, 6461 SDs, 0 SdLazy, 4066 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 37 SyntacticMatches, 16 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred 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: 38.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 79927 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 980 NumberOfCodeBlocks, 980 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 893 ConstructedInterpolants, 0 QuantifiedInterpolants, 186314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...