/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/mix006_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:13:53,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:13:53,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:13:53,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:13:53,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:13:53,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:13:53,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:13:53,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:13:53,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:13:53,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:13:53,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:13:53,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:13:53,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:13:53,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:13:53,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:13:53,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:13:53,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:13:53,767 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:13:53,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:13:53,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:13:53,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:13:53,774 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:13:53,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:13:53,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:13:53,778 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:13:53,778 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:13:53,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:13:53,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:13:53,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:13:53,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:13:53,781 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:13:53,782 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:13:53,782 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:13:53,783 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:13:53,784 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:13:53,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:13:53,785 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:13:53,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:13:53,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:13:53,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:13:53,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:13:53,788 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 12:13:53,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:13:53,809 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:13:53,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:13:53,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:13:53,810 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:13:53,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:13:53,811 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:13:53,811 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:13:53,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:13:53,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:13:53,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:13:53,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:13:53,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:13:53,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:13:53,814 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:13:53,814 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:13:53,814 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:13:53,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:13:53,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:13:53,815 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:13:53,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:13:53,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:13:53,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:13:53,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:13:53,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:13:53,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:13:53,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:13:53,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:13:53,817 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:13:53,817 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:13:54,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:13:54,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:13:54,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:13:54,145 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:13:54,145 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:13:54,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-18 12:13:54,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6614c466b/acc951c2b0ba412884d7ca970beda9e2/FLAG9912efae4 [2019-12-18 12:13:54,796 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:13:54,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_pso.oepc.i [2019-12-18 12:13:54,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6614c466b/acc951c2b0ba412884d7ca970beda9e2/FLAG9912efae4 [2019-12-18 12:13:55,038 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6614c466b/acc951c2b0ba412884d7ca970beda9e2 [2019-12-18 12:13:55,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:13:55,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:13:55,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:13:55,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:13:55,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:13:55,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@80831cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55, skipping insertion in model container [2019-12-18 12:13:55,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:13:55,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:13:55,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:13:55,727 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:13:55,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:13:55,869 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:13:55,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55 WrapperNode [2019-12-18 12:13:55,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:13:55,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:13:55,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:13:55,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:13:55,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:13:55,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:13:55,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:13:55,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:13:55,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,960 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (1/1) ... [2019-12-18 12:13:55,974 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:13:55,975 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:13:55,975 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:13:55,975 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:13:55,976 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (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 12:13:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:13:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:13:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:13:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:13:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:13:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:13:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:13:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:13:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:13:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:13:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:13:56,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:13:56,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:13:56,046 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 12:13:56,814 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:13:56,815 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:13:56,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:13:56 BoogieIcfgContainer [2019-12-18 12:13:56,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:13:56,818 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:13:56,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:13:56,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:13:56,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:13:55" (1/3) ... [2019-12-18 12:13:56,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189e7dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:13:56, skipping insertion in model container [2019-12-18 12:13:56,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:13:55" (2/3) ... [2019-12-18 12:13:56,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@189e7dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:13:56, skipping insertion in model container [2019-12-18 12:13:56,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:13:56" (3/3) ... [2019-12-18 12:13:56,825 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_pso.oepc.i [2019-12-18 12:13:56,835 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:13:56,835 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:13:56,843 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:13:56,844 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:13:56,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,885 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,885 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,886 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,886 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,887 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,887 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,888 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,896 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,920 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,920 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,941 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,942 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,943 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,946 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,947 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,947 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,948 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,949 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,949 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,950 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,951 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,952 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:13:56,977 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:13:56,997 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:13:56,997 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:13:56,997 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:13:56,997 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:13:56,997 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:13:56,998 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:13:56,998 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:13:56,998 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:13:57,014 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-18 12:13:57,016 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:13:57,106 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:13:57,106 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:13:57,127 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:13:57,156 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-18 12:13:57,207 INFO L126 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-18 12:13:57,207 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:13:57,225 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:13:57,246 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:13:57,247 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:14:02,784 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 12:14:02,929 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 12:14:02,951 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78628 [2019-12-18 12:14:02,951 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-18 12:14:02,955 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-18 12:14:20,406 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 110182 states. [2019-12-18 12:14:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 110182 states. [2019-12-18 12:14:20,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:14:20,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:20,414 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:14:20,414 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 12:14:20,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:20,419 INFO L82 PathProgramCache]: Analyzing trace with hash 917838, now seen corresponding path program 1 times [2019-12-18 12:14:20,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:20,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992017773] [2019-12-18 12:14:20,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:20,648 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 12:14:20,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992017773] [2019-12-18 12:14:20,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:20,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:14:20,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710404955] [2019-12-18 12:14:20,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:14:20,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:20,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:14:20,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:14:20,669 INFO L87 Difference]: Start difference. First operand 110182 states. Second operand 3 states. [2019-12-18 12:14:21,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:21,890 INFO L93 Difference]: Finished difference Result 109312 states and 463550 transitions. [2019-12-18 12:14:21,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:14:21,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:14:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:22,452 INFO L225 Difference]: With dead ends: 109312 [2019-12-18 12:14:22,452 INFO L226 Difference]: Without dead ends: 102592 [2019-12-18 12:14:22,453 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 12:14:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102592 states. [2019-12-18 12:14:34,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102592 to 102592. [2019-12-18 12:14:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102592 states. [2019-12-18 12:14:34,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102592 states to 102592 states and 434430 transitions. [2019-12-18 12:14:34,640 INFO L78 Accepts]: Start accepts. Automaton has 102592 states and 434430 transitions. Word has length 3 [2019-12-18 12:14:34,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:34,641 INFO L462 AbstractCegarLoop]: Abstraction has 102592 states and 434430 transitions. [2019-12-18 12:14:34,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:14:34,641 INFO L276 IsEmpty]: Start isEmpty. Operand 102592 states and 434430 transitions. [2019-12-18 12:14:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:14:34,644 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:34,644 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:14:34,645 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 12:14:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1857942485, now seen corresponding path program 1 times [2019-12-18 12:14:34,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:34,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878110023] [2019-12-18 12:14:34,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:34,782 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 12:14:34,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878110023] [2019-12-18 12:14:34,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:34,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:14:34,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815353858] [2019-12-18 12:14:34,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:14:34,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:34,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:14:34,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:14:34,787 INFO L87 Difference]: Start difference. First operand 102592 states and 434430 transitions. Second operand 4 states. [2019-12-18 12:14:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:40,458 INFO L93 Difference]: Finished difference Result 159508 states and 648686 transitions. [2019-12-18 12:14:40,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:14:40,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:14:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:41,014 INFO L225 Difference]: With dead ends: 159508 [2019-12-18 12:14:41,014 INFO L226 Difference]: Without dead ends: 159459 [2019-12-18 12:14:41,015 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 12:14:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159459 states. [2019-12-18 12:14:48,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159459 to 146095. [2019-12-18 12:14:48,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146095 states. [2019-12-18 12:14:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146095 states to 146095 states and 601450 transitions. [2019-12-18 12:14:49,163 INFO L78 Accepts]: Start accepts. Automaton has 146095 states and 601450 transitions. Word has length 11 [2019-12-18 12:14:49,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:49,164 INFO L462 AbstractCegarLoop]: Abstraction has 146095 states and 601450 transitions. [2019-12-18 12:14:49,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:14:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 146095 states and 601450 transitions. [2019-12-18 12:14:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:14:49,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:49,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:14:49,171 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 12:14:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:49,172 INFO L82 PathProgramCache]: Analyzing trace with hash 230844073, now seen corresponding path program 1 times [2019-12-18 12:14:49,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:49,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631940838] [2019-12-18 12:14:49,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:49,223 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 12:14:49,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631940838] [2019-12-18 12:14:49,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:49,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:14:49,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850373027] [2019-12-18 12:14:49,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:14:49,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:49,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:14:49,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:14:49,225 INFO L87 Difference]: Start difference. First operand 146095 states and 601450 transitions. Second operand 3 states. [2019-12-18 12:14:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:49,355 INFO L93 Difference]: Finished difference Result 32284 states and 104220 transitions. [2019-12-18 12:14:49,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:14:49,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:14:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:53,894 INFO L225 Difference]: With dead ends: 32284 [2019-12-18 12:14:53,895 INFO L226 Difference]: Without dead ends: 32284 [2019-12-18 12:14:53,895 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 12:14:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32284 states. [2019-12-18 12:14:54,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32284 to 32284. [2019-12-18 12:14:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32284 states. [2019-12-18 12:14:54,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32284 states to 32284 states and 104220 transitions. [2019-12-18 12:14:54,586 INFO L78 Accepts]: Start accepts. Automaton has 32284 states and 104220 transitions. Word has length 13 [2019-12-18 12:14:54,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:54,587 INFO L462 AbstractCegarLoop]: Abstraction has 32284 states and 104220 transitions. [2019-12-18 12:14:54,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:14:54,587 INFO L276 IsEmpty]: Start isEmpty. Operand 32284 states and 104220 transitions. [2019-12-18 12:14:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:14:54,590 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:54,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:14:54,590 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 12:14:54,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:54,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1069845708, now seen corresponding path program 1 times [2019-12-18 12:14:54,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:54,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629231455] [2019-12-18 12:14:54,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:54,680 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 12:14:54,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629231455] [2019-12-18 12:14:54,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:54,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:14:54,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020037773] [2019-12-18 12:14:54,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:14:54,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:54,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:14:54,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:14:54,683 INFO L87 Difference]: Start difference. First operand 32284 states and 104220 transitions. Second operand 4 states. [2019-12-18 12:14:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:55,058 INFO L93 Difference]: Finished difference Result 40215 states and 129418 transitions. [2019-12-18 12:14:55,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:14:55,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:14:55,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:55,141 INFO L225 Difference]: With dead ends: 40215 [2019-12-18 12:14:55,141 INFO L226 Difference]: Without dead ends: 40215 [2019-12-18 12:14:55,142 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 12:14:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40215 states. [2019-12-18 12:14:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40215 to 36090. [2019-12-18 12:14:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36090 states. [2019-12-18 12:14:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36090 states to 36090 states and 116495 transitions. [2019-12-18 12:14:55,862 INFO L78 Accepts]: Start accepts. Automaton has 36090 states and 116495 transitions. Word has length 16 [2019-12-18 12:14:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:55,863 INFO L462 AbstractCegarLoop]: Abstraction has 36090 states and 116495 transitions. [2019-12-18 12:14:55,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:14:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 36090 states and 116495 transitions. [2019-12-18 12:14:55,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:14:55,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:55,872 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] [2019-12-18 12:14:55,872 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 12:14:55,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 6986775, now seen corresponding path program 1 times [2019-12-18 12:14:55,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:55,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931752137] [2019-12-18 12:14:55,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:55,966 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 12:14:55,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931752137] [2019-12-18 12:14:55,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:55,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:14:55,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431240024] [2019-12-18 12:14:55,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:14:55,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:55,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:14:55,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:14:55,970 INFO L87 Difference]: Start difference. First operand 36090 states and 116495 transitions. Second operand 5 states. [2019-12-18 12:14:56,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:56,750 INFO L93 Difference]: Finished difference Result 46566 states and 147831 transitions. [2019-12-18 12:14:56,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:14:56,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:14:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:56,844 INFO L225 Difference]: With dead ends: 46566 [2019-12-18 12:14:56,844 INFO L226 Difference]: Without dead ends: 46559 [2019-12-18 12:14:56,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 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 12:14:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46559 states. [2019-12-18 12:14:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46559 to 35784. [2019-12-18 12:14:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35784 states. [2019-12-18 12:14:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35784 states to 35784 states and 115349 transitions. [2019-12-18 12:14:57,600 INFO L78 Accepts]: Start accepts. Automaton has 35784 states and 115349 transitions. Word has length 22 [2019-12-18 12:14:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:57,601 INFO L462 AbstractCegarLoop]: Abstraction has 35784 states and 115349 transitions. [2019-12-18 12:14:57,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:14:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 35784 states and 115349 transitions. [2019-12-18 12:14:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:14:57,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:57,613 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 12:14:57,614 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 12:14:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1437372217, now seen corresponding path program 1 times [2019-12-18 12:14:57,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:57,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578662556] [2019-12-18 12:14:57,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:57,673 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 12:14:57,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578662556] [2019-12-18 12:14:57,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:57,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:14:57,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839403670] [2019-12-18 12:14:57,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:14:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:57,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:14:57,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:14:57,675 INFO L87 Difference]: Start difference. First operand 35784 states and 115349 transitions. Second operand 4 states. [2019-12-18 12:14:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:57,743 INFO L93 Difference]: Finished difference Result 14498 states and 44125 transitions. [2019-12-18 12:14:57,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:14:57,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:14:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:57,766 INFO L225 Difference]: With dead ends: 14498 [2019-12-18 12:14:57,766 INFO L226 Difference]: Without dead ends: 14498 [2019-12-18 12:14:57,766 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 12:14:57,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2019-12-18 12:14:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 14254. [2019-12-18 12:14:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14254 states. [2019-12-18 12:14:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14254 states to 14254 states and 43429 transitions. [2019-12-18 12:14:58,007 INFO L78 Accepts]: Start accepts. Automaton has 14254 states and 43429 transitions. Word has length 25 [2019-12-18 12:14:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:58,007 INFO L462 AbstractCegarLoop]: Abstraction has 14254 states and 43429 transitions. [2019-12-18 12:14:58,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:14:58,007 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states and 43429 transitions. [2019-12-18 12:14:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:14:58,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:58,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:14:58,018 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 12:14:58,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1947963172, now seen corresponding path program 1 times [2019-12-18 12:14:58,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:58,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459202459] [2019-12-18 12:14:58,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:58,114 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 12:14:58,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459202459] [2019-12-18 12:14:58,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:58,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:14:58,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234191868] [2019-12-18 12:14:58,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:14:58,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:58,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:14:58,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:14:58,117 INFO L87 Difference]: Start difference. First operand 14254 states and 43429 transitions. Second operand 6 states. [2019-12-18 12:14:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:14:58,864 INFO L93 Difference]: Finished difference Result 39008 states and 118911 transitions. [2019-12-18 12:14:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:14:58,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 12:14:58,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:14:58,922 INFO L225 Difference]: With dead ends: 39008 [2019-12-18 12:14:58,922 INFO L226 Difference]: Without dead ends: 39008 [2019-12-18 12:14:58,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:14:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39008 states. [2019-12-18 12:14:59,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39008 to 21620. [2019-12-18 12:14:59,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21620 states. [2019-12-18 12:14:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21620 states to 21620 states and 66985 transitions. [2019-12-18 12:14:59,501 INFO L78 Accepts]: Start accepts. Automaton has 21620 states and 66985 transitions. Word has length 27 [2019-12-18 12:14:59,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:14:59,501 INFO L462 AbstractCegarLoop]: Abstraction has 21620 states and 66985 transitions. [2019-12-18 12:14:59,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:14:59,501 INFO L276 IsEmpty]: Start isEmpty. Operand 21620 states and 66985 transitions. [2019-12-18 12:14:59,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:14:59,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:14:59,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:14:59,519 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 12:14:59,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:14:59,519 INFO L82 PathProgramCache]: Analyzing trace with hash -89566793, now seen corresponding path program 1 times [2019-12-18 12:14:59,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:14:59,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143236565] [2019-12-18 12:14:59,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:14:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:14:59,607 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 12:14:59,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143236565] [2019-12-18 12:14:59,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:14:59,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:14:59,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309708459] [2019-12-18 12:14:59,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:14:59,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:14:59,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:14:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:14:59,610 INFO L87 Difference]: Start difference. First operand 21620 states and 66985 transitions. Second operand 6 states. [2019-12-18 12:15:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:00,363 INFO L93 Difference]: Finished difference Result 43584 states and 132186 transitions. [2019-12-18 12:15:00,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:15:00,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-18 12:15:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:00,428 INFO L225 Difference]: With dead ends: 43584 [2019-12-18 12:15:00,428 INFO L226 Difference]: Without dead ends: 43584 [2019-12-18 12:15:00,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:15:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43584 states. [2019-12-18 12:15:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43584 to 21360. [2019-12-18 12:15:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21360 states. [2019-12-18 12:15:00,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21360 states to 21360 states and 66500 transitions. [2019-12-18 12:15:00,897 INFO L78 Accepts]: Start accepts. Automaton has 21360 states and 66500 transitions. Word has length 28 [2019-12-18 12:15:00,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:00,897 INFO L462 AbstractCegarLoop]: Abstraction has 21360 states and 66500 transitions. [2019-12-18 12:15:00,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:15:00,897 INFO L276 IsEmpty]: Start isEmpty. Operand 21360 states and 66500 transitions. [2019-12-18 12:15:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:15:00,921 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:00,921 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] [2019-12-18 12:15:00,921 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 12:15:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1720610055, now seen corresponding path program 1 times [2019-12-18 12:15:00,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:00,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539681723] [2019-12-18 12:15:00,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:01,032 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 12:15:01,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539681723] [2019-12-18 12:15:01,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:01,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:15:01,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831103700] [2019-12-18 12:15:01,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:01,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:01,034 INFO L87 Difference]: Start difference. First operand 21360 states and 66500 transitions. Second operand 7 states. [2019-12-18 12:15:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:02,404 INFO L93 Difference]: Finished difference Result 51613 states and 157651 transitions. [2019-12-18 12:15:02,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:15:02,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 12:15:02,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:02,500 INFO L225 Difference]: With dead ends: 51613 [2019-12-18 12:15:02,500 INFO L226 Difference]: Without dead ends: 51613 [2019-12-18 12:15:02,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:15:02,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51613 states. [2019-12-18 12:15:03,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51613 to 23540. [2019-12-18 12:15:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23540 states. [2019-12-18 12:15:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23540 states to 23540 states and 73219 transitions. [2019-12-18 12:15:03,246 INFO L78 Accepts]: Start accepts. Automaton has 23540 states and 73219 transitions. Word has length 33 [2019-12-18 12:15:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:03,247 INFO L462 AbstractCegarLoop]: Abstraction has 23540 states and 73219 transitions. [2019-12-18 12:15:03,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 23540 states and 73219 transitions. [2019-12-18 12:15:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:15:03,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:03,273 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] [2019-12-18 12:15:03,273 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 12:15:03,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1518720007, now seen corresponding path program 2 times [2019-12-18 12:15:03,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:03,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014191811] [2019-12-18 12:15:03,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:03,376 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 12:15:03,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014191811] [2019-12-18 12:15:03,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:03,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:03,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255828992] [2019-12-18 12:15:03,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:15:03,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:15:03,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:03,379 INFO L87 Difference]: Start difference. First operand 23540 states and 73219 transitions. Second operand 8 states. [2019-12-18 12:15:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:05,482 INFO L93 Difference]: Finished difference Result 79921 states and 239364 transitions. [2019-12-18 12:15:05,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:15:05,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 12:15:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:05,612 INFO L225 Difference]: With dead ends: 79921 [2019-12-18 12:15:05,613 INFO L226 Difference]: Without dead ends: 79921 [2019-12-18 12:15:05,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=224, Invalid=646, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:15:05,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79921 states. [2019-12-18 12:15:06,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79921 to 22493. [2019-12-18 12:15:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22493 states. [2019-12-18 12:15:06,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22493 states to 22493 states and 69836 transitions. [2019-12-18 12:15:06,415 INFO L78 Accepts]: Start accepts. Automaton has 22493 states and 69836 transitions. Word has length 33 [2019-12-18 12:15:06,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:06,415 INFO L462 AbstractCegarLoop]: Abstraction has 22493 states and 69836 transitions. [2019-12-18 12:15:06,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:15:06,416 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states and 69836 transitions. [2019-12-18 12:15:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:15:06,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:06,441 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] [2019-12-18 12:15:06,441 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 12:15:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2146187134, now seen corresponding path program 1 times [2019-12-18 12:15:06,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:06,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785014609] [2019-12-18 12:15:06,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:06,585 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 12:15:06,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785014609] [2019-12-18 12:15:06,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:06,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:15:06,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700616849] [2019-12-18 12:15:06,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:06,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:06,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:06,588 INFO L87 Difference]: Start difference. First operand 22493 states and 69836 transitions. Second operand 7 states. [2019-12-18 12:15:08,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:08,296 INFO L93 Difference]: Finished difference Result 45327 states and 136889 transitions. [2019-12-18 12:15:08,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 12:15:08,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-18 12:15:08,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:08,363 INFO L225 Difference]: With dead ends: 45327 [2019-12-18 12:15:08,364 INFO L226 Difference]: Without dead ends: 45327 [2019-12-18 12:15:08,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:15:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45327 states. [2019-12-18 12:15:08,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45327 to 20305. [2019-12-18 12:15:08,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20305 states. [2019-12-18 12:15:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20305 states to 20305 states and 63138 transitions. [2019-12-18 12:15:08,831 INFO L78 Accepts]: Start accepts. Automaton has 20305 states and 63138 transitions. Word has length 34 [2019-12-18 12:15:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:08,832 INFO L462 AbstractCegarLoop]: Abstraction has 20305 states and 63138 transitions. [2019-12-18 12:15:08,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 20305 states and 63138 transitions. [2019-12-18 12:15:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:15:08,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:08,851 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] [2019-12-18 12:15:08,851 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 12:15:08,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:08,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1401085166, now seen corresponding path program 2 times [2019-12-18 12:15:08,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:08,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491591837] [2019-12-18 12:15:08,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:08,991 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 12:15:08,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491591837] [2019-12-18 12:15:08,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:08,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:08,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686677772] [2019-12-18 12:15:08,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:15:08,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:08,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:15:08,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:15:08,994 INFO L87 Difference]: Start difference. First operand 20305 states and 63138 transitions. Second operand 8 states. [2019-12-18 12:15:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:10,941 INFO L93 Difference]: Finished difference Result 57497 states and 172162 transitions. [2019-12-18 12:15:10,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:15:10,942 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-18 12:15:10,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:11,102 INFO L225 Difference]: With dead ends: 57497 [2019-12-18 12:15:11,102 INFO L226 Difference]: Without dead ends: 57497 [2019-12-18 12:15:11,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:15:11,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57497 states. [2019-12-18 12:15:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57497 to 19933. [2019-12-18 12:15:12,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19933 states. [2019-12-18 12:15:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19933 states to 19933 states and 61986 transitions. [2019-12-18 12:15:12,212 INFO L78 Accepts]: Start accepts. Automaton has 19933 states and 61986 transitions. Word has length 34 [2019-12-18 12:15:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:12,213 INFO L462 AbstractCegarLoop]: Abstraction has 19933 states and 61986 transitions. [2019-12-18 12:15:12,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:15:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 19933 states and 61986 transitions. [2019-12-18 12:15:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:15:12,242 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:12,242 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] [2019-12-18 12:15:12,242 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 12:15:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 342833665, now seen corresponding path program 1 times [2019-12-18 12:15:12,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:12,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867213641] [2019-12-18 12:15:12,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:12,308 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 12:15:12,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867213641] [2019-12-18 12:15:12,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:12,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:15:12,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791456201] [2019-12-18 12:15:12,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:12,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:12,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:12,312 INFO L87 Difference]: Start difference. First operand 19933 states and 61986 transitions. Second operand 3 states. [2019-12-18 12:15:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:12,392 INFO L93 Difference]: Finished difference Result 19932 states and 61984 transitions. [2019-12-18 12:15:12,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:12,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:15:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:12,432 INFO L225 Difference]: With dead ends: 19932 [2019-12-18 12:15:12,432 INFO L226 Difference]: Without dead ends: 19932 [2019-12-18 12:15:12,438 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 12:15:12,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19932 states. [2019-12-18 12:15:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19932 to 19932. [2019-12-18 12:15:13,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19932 states. [2019-12-18 12:15:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19932 states to 19932 states and 61984 transitions. [2019-12-18 12:15:13,260 INFO L78 Accepts]: Start accepts. Automaton has 19932 states and 61984 transitions. Word has length 39 [2019-12-18 12:15:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:13,260 INFO L462 AbstractCegarLoop]: Abstraction has 19932 states and 61984 transitions. [2019-12-18 12:15:13,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:13,261 INFO L276 IsEmpty]: Start isEmpty. Operand 19932 states and 61984 transitions. [2019-12-18 12:15:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:15:13,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:13,301 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] [2019-12-18 12:15:13,302 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 12:15:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1054064562, now seen corresponding path program 1 times [2019-12-18 12:15:13,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:13,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951569927] [2019-12-18 12:15:13,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:13,399 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 12:15:13,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951569927] [2019-12-18 12:15:13,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:13,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:13,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939884097] [2019-12-18 12:15:13,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:13,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:13,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:13,402 INFO L87 Difference]: Start difference. First operand 19932 states and 61984 transitions. Second operand 3 states. [2019-12-18 12:15:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:13,611 INFO L93 Difference]: Finished difference Result 34295 states and 106923 transitions. [2019-12-18 12:15:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:13,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-18 12:15:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:13,659 INFO L225 Difference]: With dead ends: 34295 [2019-12-18 12:15:13,659 INFO L226 Difference]: Without dead ends: 17356 [2019-12-18 12:15:13,661 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 12:15:13,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17356 states. [2019-12-18 12:15:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17356 to 17261. [2019-12-18 12:15:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17261 states. [2019-12-18 12:15:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17261 states to 17261 states and 52716 transitions. [2019-12-18 12:15:14,073 INFO L78 Accepts]: Start accepts. Automaton has 17261 states and 52716 transitions. Word has length 40 [2019-12-18 12:15:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:14,074 INFO L462 AbstractCegarLoop]: Abstraction has 17261 states and 52716 transitions. [2019-12-18 12:15:14,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 17261 states and 52716 transitions. [2019-12-18 12:15:14,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:15:14,098 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:14,098 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] [2019-12-18 12:15:14,098 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 12:15:14,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1620503104, now seen corresponding path program 2 times [2019-12-18 12:15:14,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:14,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351611259] [2019-12-18 12:15:14,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:14,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:15:14,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351611259] [2019-12-18 12:15:14,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:14,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:15:14,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204185528] [2019-12-18 12:15:14,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:15:14,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:14,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:15:14,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:15:14,169 INFO L87 Difference]: Start difference. First operand 17261 states and 52716 transitions. Second operand 5 states. [2019-12-18 12:15:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:14,240 INFO L93 Difference]: Finished difference Result 16032 states and 49812 transitions. [2019-12-18 12:15:14,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:15:14,240 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:15:14,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:14,268 INFO L225 Difference]: With dead ends: 16032 [2019-12-18 12:15:14,268 INFO L226 Difference]: Without dead ends: 14317 [2019-12-18 12:15:14,271 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 12:15:14,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14317 states. [2019-12-18 12:15:14,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14317 to 13743. [2019-12-18 12:15:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13743 states. [2019-12-18 12:15:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13743 states to 13743 states and 44025 transitions. [2019-12-18 12:15:14,496 INFO L78 Accepts]: Start accepts. Automaton has 13743 states and 44025 transitions. Word has length 40 [2019-12-18 12:15:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:14,496 INFO L462 AbstractCegarLoop]: Abstraction has 13743 states and 44025 transitions. [2019-12-18 12:15:14,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:15:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13743 states and 44025 transitions. [2019-12-18 12:15:14,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:14,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:14,517 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] [2019-12-18 12:15:14,517 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 12:15:14,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -558765540, now seen corresponding path program 1 times [2019-12-18 12:15:14,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:14,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584720880] [2019-12-18 12:15:14,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:14,654 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 12:15:14,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584720880] [2019-12-18 12:15:14,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:14,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:15:14,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110867161] [2019-12-18 12:15:14,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:15:14,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:14,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:15:14,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:15:14,658 INFO L87 Difference]: Start difference. First operand 13743 states and 44025 transitions. Second operand 9 states. [2019-12-18 12:15:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:16,553 INFO L93 Difference]: Finished difference Result 117155 states and 365478 transitions. [2019-12-18 12:15:16,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 12:15:16,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:15:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:16,691 INFO L225 Difference]: With dead ends: 117155 [2019-12-18 12:15:16,692 INFO L226 Difference]: Without dead ends: 85185 [2019-12-18 12:15:16,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=402, Invalid=1238, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 12:15:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85185 states. [2019-12-18 12:15:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85185 to 19323. [2019-12-18 12:15:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19323 states. [2019-12-18 12:15:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19323 states to 19323 states and 62406 transitions. [2019-12-18 12:15:17,724 INFO L78 Accepts]: Start accepts. Automaton has 19323 states and 62406 transitions. Word has length 64 [2019-12-18 12:15:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:17,724 INFO L462 AbstractCegarLoop]: Abstraction has 19323 states and 62406 transitions. [2019-12-18 12:15:17,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:15:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19323 states and 62406 transitions. [2019-12-18 12:15:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:17,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:17,746 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] [2019-12-18 12:15:17,746 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 12:15:17,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -977893927, now seen corresponding path program 1 times [2019-12-18 12:15:17,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:17,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472139008] [2019-12-18 12:15:17,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:17,808 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 12:15:17,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472139008] [2019-12-18 12:15:17,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:17,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:15:17,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079933647] [2019-12-18 12:15:17,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:17,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:17,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:17,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:17,812 INFO L87 Difference]: Start difference. First operand 19323 states and 62406 transitions. Second operand 3 states. [2019-12-18 12:15:17,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:17,942 INFO L93 Difference]: Finished difference Result 24441 states and 76268 transitions. [2019-12-18 12:15:17,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:17,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:15:17,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:17,992 INFO L225 Difference]: With dead ends: 24441 [2019-12-18 12:15:17,993 INFO L226 Difference]: Without dead ends: 24015 [2019-12-18 12:15:17,993 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 12:15:18,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24015 states. [2019-12-18 12:15:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24015 to 18624. [2019-12-18 12:15:18,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18624 states. [2019-12-18 12:15:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18624 states to 18624 states and 59291 transitions. [2019-12-18 12:15:18,564 INFO L78 Accepts]: Start accepts. Automaton has 18624 states and 59291 transitions. Word has length 64 [2019-12-18 12:15:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:18,564 INFO L462 AbstractCegarLoop]: Abstraction has 18624 states and 59291 transitions. [2019-12-18 12:15:18,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 18624 states and 59291 transitions. [2019-12-18 12:15:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:18,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:18,594 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] [2019-12-18 12:15:18,594 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 12:15:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:18,594 INFO L82 PathProgramCache]: Analyzing trace with hash -329697764, now seen corresponding path program 2 times [2019-12-18 12:15:18,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:18,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61020665] [2019-12-18 12:15:18,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:18,726 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 12:15:18,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61020665] [2019-12-18 12:15:18,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:18,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:15:18,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371450664] [2019-12-18 12:15:18,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:15:18,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:15:18,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:15:18,734 INFO L87 Difference]: Start difference. First operand 18624 states and 59291 transitions. Second operand 9 states. [2019-12-18 12:15:20,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:20,672 INFO L93 Difference]: Finished difference Result 103421 states and 318837 transitions. [2019-12-18 12:15:20,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 12:15:20,672 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-18 12:15:20,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:20,796 INFO L225 Difference]: With dead ends: 103421 [2019-12-18 12:15:20,796 INFO L226 Difference]: Without dead ends: 79016 [2019-12-18 12:15:20,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=1077, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 12:15:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79016 states. [2019-12-18 12:15:21,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79016 to 20828. [2019-12-18 12:15:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20828 states. [2019-12-18 12:15:21,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20828 states to 20828 states and 66686 transitions. [2019-12-18 12:15:21,908 INFO L78 Accepts]: Start accepts. Automaton has 20828 states and 66686 transitions. Word has length 64 [2019-12-18 12:15:21,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:21,909 INFO L462 AbstractCegarLoop]: Abstraction has 20828 states and 66686 transitions. [2019-12-18 12:15:21,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:15:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 20828 states and 66686 transitions. [2019-12-18 12:15:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:21,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:21,935 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] [2019-12-18 12:15:21,936 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 12:15:21,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash 128153586, now seen corresponding path program 3 times [2019-12-18 12:15:21,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:21,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244592147] [2019-12-18 12:15:21,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:22,008 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 12:15:22,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244592147] [2019-12-18 12:15:22,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:22,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:22,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762585180] [2019-12-18 12:15:22,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:22,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:22,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:22,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:22,010 INFO L87 Difference]: Start difference. First operand 20828 states and 66686 transitions. Second operand 7 states. [2019-12-18 12:15:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:22,655 INFO L93 Difference]: Finished difference Result 61603 states and 191636 transitions. [2019-12-18 12:15:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:15:22,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:15:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:22,728 INFO L225 Difference]: With dead ends: 61603 [2019-12-18 12:15:22,728 INFO L226 Difference]: Without dead ends: 44248 [2019-12-18 12:15:22,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:15:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44248 states. [2019-12-18 12:15:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44248 to 24601. [2019-12-18 12:15:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24601 states. [2019-12-18 12:15:23,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24601 states to 24601 states and 78988 transitions. [2019-12-18 12:15:23,301 INFO L78 Accepts]: Start accepts. Automaton has 24601 states and 78988 transitions. Word has length 64 [2019-12-18 12:15:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:23,301 INFO L462 AbstractCegarLoop]: Abstraction has 24601 states and 78988 transitions. [2019-12-18 12:15:23,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:23,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24601 states and 78988 transitions. [2019-12-18 12:15:23,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:23,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:23,331 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] [2019-12-18 12:15:23,331 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 12:15:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:23,331 INFO L82 PathProgramCache]: Analyzing trace with hash 792871072, now seen corresponding path program 4 times [2019-12-18 12:15:23,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:23,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645131439] [2019-12-18 12:15:23,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:23,406 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 12:15:23,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645131439] [2019-12-18 12:15:23,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:23,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:15:23,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137794429] [2019-12-18 12:15:23,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:15:23,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:23,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:15:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:15:23,408 INFO L87 Difference]: Start difference. First operand 24601 states and 78988 transitions. Second operand 7 states. [2019-12-18 12:15:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:24,003 INFO L93 Difference]: Finished difference Result 50126 states and 155497 transitions. [2019-12-18 12:15:24,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:15:24,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 12:15:24,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:24,128 INFO L225 Difference]: With dead ends: 50126 [2019-12-18 12:15:24,128 INFO L226 Difference]: Without dead ends: 45899 [2019-12-18 12:15:24,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:15:24,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45899 states. [2019-12-18 12:15:24,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45899 to 24809. [2019-12-18 12:15:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24809 states. [2019-12-18 12:15:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24809 states to 24809 states and 79626 transitions. [2019-12-18 12:15:24,789 INFO L78 Accepts]: Start accepts. Automaton has 24809 states and 79626 transitions. Word has length 64 [2019-12-18 12:15:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:24,789 INFO L462 AbstractCegarLoop]: Abstraction has 24809 states and 79626 transitions. [2019-12-18 12:15:24,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:15:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24809 states and 79626 transitions. [2019-12-18 12:15:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:15:24,822 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:24,822 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] [2019-12-18 12:15:24,822 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:15:24,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:24,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1295242324, now seen corresponding path program 5 times [2019-12-18 12:15:24,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:24,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122754342] [2019-12-18 12:15:24,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:24,898 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 12:15:24,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122754342] [2019-12-18 12:15:24,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:24,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:24,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223107269] [2019-12-18 12:15:24,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:24,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:24,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:24,900 INFO L87 Difference]: Start difference. First operand 24809 states and 79626 transitions. Second operand 3 states. [2019-12-18 12:15:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:25,146 INFO L93 Difference]: Finished difference Result 21150 states and 66353 transitions. [2019-12-18 12:15:25,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:25,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:15:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:25,175 INFO L225 Difference]: With dead ends: 21150 [2019-12-18 12:15:25,176 INFO L226 Difference]: Without dead ends: 21150 [2019-12-18 12:15:25,176 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 12:15:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21150 states. [2019-12-18 12:15:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21150 to 19698. [2019-12-18 12:15:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19698 states. [2019-12-18 12:15:25,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19698 states to 19698 states and 61620 transitions. [2019-12-18 12:15:25,485 INFO L78 Accepts]: Start accepts. Automaton has 19698 states and 61620 transitions. Word has length 64 [2019-12-18 12:15:25,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:25,485 INFO L462 AbstractCegarLoop]: Abstraction has 19698 states and 61620 transitions. [2019-12-18 12:15:25,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 19698 states and 61620 transitions. [2019-12-18 12:15:25,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:15:25,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:25,508 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 12:15:25,508 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:15:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:25,508 INFO L82 PathProgramCache]: Analyzing trace with hash -646853691, now seen corresponding path program 1 times [2019-12-18 12:15:25,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:25,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227855497] [2019-12-18 12:15:25,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:15:25,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227855497] [2019-12-18 12:15:25,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:25,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:25,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442413307] [2019-12-18 12:15:25,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:25,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:25,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:25,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:25,562 INFO L87 Difference]: Start difference. First operand 19698 states and 61620 transitions. Second operand 3 states. [2019-12-18 12:15:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:25,696 INFO L93 Difference]: Finished difference Result 23340 states and 72250 transitions. [2019-12-18 12:15:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:25,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:15:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:25,751 INFO L225 Difference]: With dead ends: 23340 [2019-12-18 12:15:25,751 INFO L226 Difference]: Without dead ends: 23340 [2019-12-18 12:15:25,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 12:15:25,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23340 states. [2019-12-18 12:15:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23340 to 20566. [2019-12-18 12:15:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20566 states. [2019-12-18 12:15:26,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20566 states to 20566 states and 64237 transitions. [2019-12-18 12:15:26,320 INFO L78 Accepts]: Start accepts. Automaton has 20566 states and 64237 transitions. Word has length 65 [2019-12-18 12:15:26,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:26,321 INFO L462 AbstractCegarLoop]: Abstraction has 20566 states and 64237 transitions. [2019-12-18 12:15:26,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:26,321 INFO L276 IsEmpty]: Start isEmpty. Operand 20566 states and 64237 transitions. [2019-12-18 12:15:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:15:26,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:26,344 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 12:15:26,344 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:15:26,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash 882937623, now seen corresponding path program 1 times [2019-12-18 12:15:26,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:26,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457816034] [2019-12-18 12:15:26,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:26,454 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 12:15:26,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457816034] [2019-12-18 12:15:26,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:26,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:15:26,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308631203] [2019-12-18 12:15:26,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:15:26,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:15:26,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:15:26,456 INFO L87 Difference]: Start difference. First operand 20566 states and 64237 transitions. Second operand 9 states. [2019-12-18 12:15:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:27,875 INFO L93 Difference]: Finished difference Result 78349 states and 236745 transitions. [2019-12-18 12:15:27,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:15:27,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-18 12:15:27,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:27,981 INFO L225 Difference]: With dead ends: 78349 [2019-12-18 12:15:27,982 INFO L226 Difference]: Without dead ends: 74330 [2019-12-18 12:15:27,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2019-12-18 12:15:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74330 states. [2019-12-18 12:15:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74330 to 21133. [2019-12-18 12:15:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21133 states. [2019-12-18 12:15:28,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21133 states to 21133 states and 66093 transitions. [2019-12-18 12:15:28,731 INFO L78 Accepts]: Start accepts. Automaton has 21133 states and 66093 transitions. Word has length 66 [2019-12-18 12:15:28,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:28,731 INFO L462 AbstractCegarLoop]: Abstraction has 21133 states and 66093 transitions. [2019-12-18 12:15:28,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:15:28,731 INFO L276 IsEmpty]: Start isEmpty. Operand 21133 states and 66093 transitions. [2019-12-18 12:15:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:15:28,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:28,756 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 12:15:28,756 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:15:28,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:28,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1442275055, now seen corresponding path program 1 times [2019-12-18 12:15:28,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:28,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366193714] [2019-12-18 12:15:28,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:29,252 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 12:15:29,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366193714] [2019-12-18 12:15:29,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:29,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 12:15:29,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149211137] [2019-12-18 12:15:29,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 12:15:29,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:29,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 12:15:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:15:29,254 INFO L87 Difference]: Start difference. First operand 21133 states and 66093 transitions. Second operand 13 states. [2019-12-18 12:15:33,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:33,748 INFO L93 Difference]: Finished difference Result 55472 states and 165833 transitions. [2019-12-18 12:15:33,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-18 12:15:33,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-12-18 12:15:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:33,828 INFO L225 Difference]: With dead ends: 55472 [2019-12-18 12:15:33,829 INFO L226 Difference]: Without dead ends: 55254 [2019-12-18 12:15:33,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=455, Invalid=2301, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 12:15:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55254 states. [2019-12-18 12:15:34,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55254 to 26176. [2019-12-18 12:15:34,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26176 states. [2019-12-18 12:15:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26176 states to 26176 states and 80675 transitions. [2019-12-18 12:15:34,493 INFO L78 Accepts]: Start accepts. Automaton has 26176 states and 80675 transitions. Word has length 66 [2019-12-18 12:15:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:34,494 INFO L462 AbstractCegarLoop]: Abstraction has 26176 states and 80675 transitions. [2019-12-18 12:15:34,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 12:15:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26176 states and 80675 transitions. [2019-12-18 12:15:34,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:15:34,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:34,522 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 12:15:34,522 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:15:34,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:34,523 INFO L82 PathProgramCache]: Analyzing trace with hash -544773579, now seen corresponding path program 2 times [2019-12-18 12:15:34,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:34,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114544176] [2019-12-18 12:15:34,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:15:34,604 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 12:15:34,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114544176] [2019-12-18 12:15:34,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:15:34,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:15:34,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001842029] [2019-12-18 12:15:34,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:15:34,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:15:34,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:15:34,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:15:34,606 INFO L87 Difference]: Start difference. First operand 26176 states and 80675 transitions. Second operand 3 states. [2019-12-18 12:15:34,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:15:34,714 INFO L93 Difference]: Finished difference Result 26176 states and 80674 transitions. [2019-12-18 12:15:34,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:15:34,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 12:15:34,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:15:34,764 INFO L225 Difference]: With dead ends: 26176 [2019-12-18 12:15:34,764 INFO L226 Difference]: Without dead ends: 26176 [2019-12-18 12:15:34,765 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 12:15:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26176 states. [2019-12-18 12:15:35,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26176 to 18683. [2019-12-18 12:15:35,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18683 states. [2019-12-18 12:15:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18683 states to 18683 states and 57758 transitions. [2019-12-18 12:15:35,125 INFO L78 Accepts]: Start accepts. Automaton has 18683 states and 57758 transitions. Word has length 66 [2019-12-18 12:15:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:15:35,125 INFO L462 AbstractCegarLoop]: Abstraction has 18683 states and 57758 transitions. [2019-12-18 12:15:35,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:15:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 18683 states and 57758 transitions. [2019-12-18 12:15:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 12:15:35,144 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:15:35,144 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 12:15:35,145 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:15:35,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:15:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash 763340387, now seen corresponding path program 1 times [2019-12-18 12:15:35,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:15:35,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460585445] [2019-12-18 12:15:35,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:15:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:15:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:15:35,269 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:15:35,269 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:15:35,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~z$r_buff0_thd3~0_367) (= v_~z$r_buff0_thd0~0_147 0) (= v_~z$w_buff0_used~0_850 0) (= v_~z$w_buff0~0_393 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 v_~z$r_buff1_thd3~0_322) (= |v_ULTIMATE.start_main_~#t159~0.offset_17| 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_27| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t159~0.base_27|) |v_ULTIMATE.start_main_~#t159~0.offset_17| 0)) |v_#memory_int_19|) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t159~0.base_27| 1)) (= v_~weak$$choice2~0_147 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t159~0.base_27|) (= v_~z$read_delayed~0_6 0) (= v_~z$r_buff1_thd1~0_158 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t159~0.base_27|)) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_168 0) (= v_~z$w_buff1_used~0_568 0) (= v_~main$tmp_guard1~0_41 0) (= 0 v_~__unbuffered_p2_EAX~0_41) (= 0 |v_#NULL.base_6|) (= 0 v_~z$flush_delayed~0_26) (= v_~__unbuffered_p2_EBX~0_49 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~z$r_buff0_thd1~0_210 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t159~0.base_27| 4)) (= 0 v_~x~0_154) (= v_~z$r_buff0_thd2~0_129 0) (= 0 v_~__unbuffered_cnt~0_88) (= v_~z~0_181 0) (= v_~z$mem_tmp~0_15 0) (= 0 v_~weak$$choice0~0_13) (= v_~y~0_31 0) (= v_~z$r_buff1_thd0~0_191 0) (= v_~z$w_buff1~0_253 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_168, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_61|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_191|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_147, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_49, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_568, ULTIMATE.start_main_~#t159~0.base=|v_ULTIMATE.start_main_~#t159~0.base_27|, ~z$flush_delayed~0=v_~z$flush_delayed~0_26, ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_158, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_367, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~x~0=v_~x~0_154, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_253, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_39|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_16|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_43|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_191, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_129, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_27|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_850, ~z$w_buff0~0=v_~z$w_buff0~0_393, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_322, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t159~0.offset=|v_ULTIMATE.start_main_~#t159~0.offset_17|, ~z~0=v_~z~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_147, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_210} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t159~0.base, ~z$flush_delayed~0, ULTIMATE.start_main_~#t160~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t161~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t159~0.offset, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:15:35,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L830-1-->L832: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t160~0.base_11|) |v_ULTIMATE.start_main_~#t160~0.offset_9| 1)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t160~0.base_11| 0)) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11| 1) |v_#valid_35|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t160~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t160~0.offset_9|) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t160~0.base_11|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t160~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t160~0.base=|v_ULTIMATE.start_main_~#t160~0.base_11|, ULTIMATE.start_main_~#t160~0.offset=|v_ULTIMATE.start_main_~#t160~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t160~0.base, ULTIMATE.start_main_~#t160~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 12:15:35,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= v_~z$r_buff0_thd0~0_17 v_~z$r_buff1_thd0~0_13) (= 1 v_~x~0_6) (= v_~z$r_buff0_thd1~0_21 1) (= v_~z$r_buff0_thd3~0_47 v_~z$r_buff1_thd3~0_31) (= v_~z$r_buff0_thd1~0_22 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_22, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_17, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_31, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_13, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_47, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_21, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 12:15:35,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1146187107 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1146187107 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite9_Out1146187107| ~z$w_buff1~0_In1146187107) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out1146187107| ~z~0_In1146187107) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1146187107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146187107, ~z$w_buff1~0=~z$w_buff1~0_In1146187107, ~z~0=~z~0_In1146187107} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1146187107|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1146187107, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1146187107, ~z$w_buff1~0=~z$w_buff1~0_In1146187107, ~z~0=~z~0_In1146187107} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-18 12:15:35,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_12| v_~z~0_27) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_12|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_11|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_17|, ~z~0=v_~z~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-18 12:15:35,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1255824328 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1255824328 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1255824328 |P1Thread1of1ForFork2_#t~ite11_Out-1255824328|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1255824328|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255824328, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1255824328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1255824328, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1255824328|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1255824328} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:15:35,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-739293139 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-739293139 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In-739293139 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-739293139 256)))) (or (and (= ~z$w_buff1_used~0_In-739293139 |P1Thread1of1ForFork2_#t~ite12_Out-739293139|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out-739293139| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-739293139, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-739293139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-739293139, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-739293139} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-739293139, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-739293139, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-739293139, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-739293139|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-739293139} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:15:35,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t161~0.base_9|) |v_ULTIMATE.start_main_~#t161~0.offset_8| 2))) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9|) 0) (not (= |v_ULTIMATE.start_main_~#t161~0.base_9| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t161~0.base_9|) (= |v_ULTIMATE.start_main_~#t161~0.offset_8| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t161~0.base_9| 1) |v_#valid_27|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t161~0.base_9| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t161~0.offset=|v_ULTIMATE.start_main_~#t161~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t161~0.base=|v_ULTIMATE.start_main_~#t161~0.base_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t161~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t161~0.base, #length] because there is no mapped edge [2019-12-18 12:15:35,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1819955989 256) 0))) (or (and (= ~z$w_buff0~0_In1819955989 |P2Thread1of1ForFork0_#t~ite21_Out1819955989|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In1819955989| |P2Thread1of1ForFork0_#t~ite20_Out1819955989|)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1819955989 256) 0))) (or (and (= (mod ~z$w_buff1_used~0_In1819955989 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd3~0_In1819955989 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In1819955989 256)))) (= |P2Thread1of1ForFork0_#t~ite20_Out1819955989| ~z$w_buff0~0_In1819955989) (= |P2Thread1of1ForFork0_#t~ite20_Out1819955989| |P2Thread1of1ForFork0_#t~ite21_Out1819955989|) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1819955989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1819955989, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1819955989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1819955989, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1819955989, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In1819955989|, ~weak$$choice2~0=~weak$$choice2~0_In1819955989} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out1819955989|, ~z$w_buff0~0=~z$w_buff0~0_In1819955989, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1819955989, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1819955989, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1819955989, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1819955989, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out1819955989|, ~weak$$choice2~0=~weak$$choice2~0_In1819955989} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-18 12:15:35,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-567466782 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-567466782 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-567466782| 0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out-567466782| ~z$r_buff0_thd2~0_In-567466782) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-567466782, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-567466782} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-567466782, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-567466782|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-567466782} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:15:35,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In158608578 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In158608578 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In158608578 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd2~0_In158608578 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In158608578 |P1Thread1of1ForFork2_#t~ite14_Out158608578|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out158608578|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In158608578, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In158608578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158608578, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In158608578} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In158608578, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In158608578, ~z$w_buff1_used~0=~z$w_buff1_used~0_In158608578, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out158608578|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In158608578} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:15:35,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L775-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P1Thread1of1ForFork2_#t~ite14_32| v_~z$r_buff1_thd2~0_56) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_56, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-18 12:15:35,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In670093139 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In670093139| |P2Thread1of1ForFork0_#t~ite23_Out670093139|) (= |P2Thread1of1ForFork0_#t~ite24_Out670093139| ~z$w_buff1~0_In670093139)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In670093139 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In670093139 256)) (and (= (mod ~z$w_buff1_used~0_In670093139 256) 0) .cse1) (and (= 0 (mod ~z$r_buff1_thd3~0_In670093139 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite24_Out670093139| |P2Thread1of1ForFork0_#t~ite23_Out670093139|) (= |P2Thread1of1ForFork0_#t~ite23_Out670093139| ~z$w_buff1~0_In670093139) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In670093139, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In670093139, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In670093139|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In670093139, ~z$w_buff1~0=~z$w_buff1~0_In670093139, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In670093139, ~weak$$choice2~0=~weak$$choice2~0_In670093139} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In670093139, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out670093139|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In670093139, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out670093139|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In670093139, ~z$w_buff1~0=~z$w_buff1~0_In670093139, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In670093139, ~weak$$choice2~0=~weak$$choice2~0_In670093139} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:15:35,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L798-->L798-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-719473414 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite27_Out-719473414| |P2Thread1of1ForFork0_#t~ite26_Out-719473414|) (= ~z$w_buff0_used~0_In-719473414 |P2Thread1of1ForFork0_#t~ite26_Out-719473414|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-719473414 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-719473414 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-719473414 256) 0)) (= (mod ~z$w_buff0_used~0_In-719473414 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite26_In-719473414| |P2Thread1of1ForFork0_#t~ite26_Out-719473414|) (= |P2Thread1of1ForFork0_#t~ite27_Out-719473414| ~z$w_buff0_used~0_In-719473414) (not .cse0)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-719473414|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-719473414, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-719473414, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-719473414, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-719473414, ~weak$$choice2~0=~weak$$choice2~0_In-719473414} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-719473414|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-719473414|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-719473414, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-719473414, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-719473414, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-719473414, ~weak$$choice2~0=~weak$$choice2~0_In-719473414} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-18 12:15:35,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff0_thd3~0_66)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_66, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 12:15:35,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= 0 v_~z$flush_delayed~0_11) (= v_~z~0_50 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_12 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_13|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_11, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 12:15:35,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In211299883 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In211299883 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite5_Out211299883| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out211299883| ~z$w_buff0_used~0_In211299883) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In211299883, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In211299883} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out211299883|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In211299883, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In211299883} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:15:35,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In281891096 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In281891096 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out281891096| ~z$w_buff1~0_In281891096) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out281891096| ~z~0_In281891096) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In281891096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In281891096, ~z$w_buff1~0=~z$w_buff1~0_In281891096, ~z~0=~z~0_In281891096} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out281891096|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In281891096, ~z$w_buff1_used~0=~z$w_buff1_used~0_In281891096, ~z$w_buff1~0=~z$w_buff1~0_In281891096, ~z~0=~z~0_In281891096} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:15:35,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In1069801628 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1069801628 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1069801628 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1069801628 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1069801628 |P0Thread1of1ForFork1_#t~ite6_Out1069801628|)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out1069801628| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1069801628, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1069801628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1069801628, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1069801628} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1069801628, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1069801628|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1069801628, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1069801628, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1069801628} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:15:35,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1029183424 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1029183424 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1029183424 0)) (and (= ~z$r_buff0_thd1~0_Out1029183424 ~z$r_buff0_thd1~0_In1029183424) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1029183424, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1029183424} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1029183424, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1029183424|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1029183424} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:15:35,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-908180080 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-908180080 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-908180080 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd1~0_In-908180080 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-908180080|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In-908180080 |P0Thread1of1ForFork1_#t~ite8_Out-908180080|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-908180080, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-908180080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908180080, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-908180080} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-908180080|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-908180080, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-908180080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-908180080, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-908180080} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:15:35,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_72 |v_P0Thread1of1ForFork1_#t~ite8_32|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_31|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_72, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 12:15:35,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|, ~z~0=v_~z~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-18 12:15:35,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In403756138 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In403756138 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out403756138| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out403756138| ~z$w_buff0_used~0_In403756138)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In403756138, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In403756138} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In403756138, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out403756138|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In403756138} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:15:35,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2070423240 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-2070423240 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-2070423240 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-2070423240 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2070423240| ~z$w_buff1_used~0_In-2070423240) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-2070423240| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070423240, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2070423240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070423240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2070423240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2070423240, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-2070423240, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2070423240, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-2070423240, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-2070423240|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:15:35,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In41635010 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In41635010 256)))) (or (and (= ~z$r_buff0_thd3~0_In41635010 |P2Thread1of1ForFork0_#t~ite42_Out41635010|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out41635010| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In41635010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In41635010} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In41635010, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In41635010, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out41635010|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:15:35,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1092939163 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1092939163 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In-1092939163 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1092939163 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out-1092939163| ~z$r_buff1_thd3~0_In-1092939163) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out-1092939163| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1092939163, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1092939163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1092939163, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1092939163} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1092939163|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1092939163, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1092939163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1092939163, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1092939163} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:15:35,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [855] [855] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_121 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_121, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:15:35,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= v_~main$tmp_guard0~0_11 1) (= 3 v_~__unbuffered_cnt~0_28)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 12:15:35,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1963033522 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1963033522 256))) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out1963033522| |ULTIMATE.start_main_#t~ite47_Out1963033522|))) (or (and (not .cse0) .cse1 (not .cse2) (= ~z$w_buff1~0_In1963033522 |ULTIMATE.start_main_#t~ite47_Out1963033522|)) (and (or .cse0 .cse2) .cse1 (= ~z~0_In1963033522 |ULTIMATE.start_main_#t~ite47_Out1963033522|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1963033522, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1963033522, ~z$w_buff1~0=~z$w_buff1~0_In1963033522, ~z~0=~z~0_In1963033522} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1963033522, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1963033522|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1963033522, ~z$w_buff1~0=~z$w_buff1~0_In1963033522, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out1963033522|, ~z~0=~z~0_In1963033522} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 12:15:35,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1509599506 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1509599506 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1509599506| 0)) (and (= |ULTIMATE.start_main_#t~ite49_Out1509599506| ~z$w_buff0_used~0_In1509599506) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1509599506, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1509599506} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1509599506, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1509599506, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1509599506|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:15:35,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-1627125586 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1627125586 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1627125586 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1627125586 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1627125586| 0)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1627125586 |ULTIMATE.start_main_#t~ite50_Out-1627125586|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1627125586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627125586, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1627125586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1627125586} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1627125586|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1627125586, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1627125586, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1627125586, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1627125586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:15:35,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1249280937 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1249280937 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out1249280937| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1249280937| ~z$r_buff0_thd0~0_In1249280937)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1249280937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1249280937} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1249280937, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1249280937|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1249280937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:15:35,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In920423121 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In920423121 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In920423121 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In920423121 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out920423121|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd0~0_In920423121 |ULTIMATE.start_main_#t~ite52_Out920423121|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In920423121, ~z$w_buff0_used~0=~z$w_buff0_used~0_In920423121, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In920423121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In920423121} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out920423121|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In920423121, ~z$w_buff0_used~0=~z$w_buff0_used~0_In920423121, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In920423121, ~z$w_buff1_used~0=~z$w_buff1_used~0_In920423121} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:15:35,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [886] [886] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_18 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= 2 v_~__unbuffered_p1_EAX~0_22) (= v_~x~0_65 2) (= v_~__unbuffered_p2_EBX~0_27 0) (= v_~z$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_~__unbuffered_p1_EBX~0_23 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_101, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_65, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:15:35,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:15:35 BasicIcfg [2019-12-18 12:15:35,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:15:35,510 INFO L168 Benchmark]: Toolchain (without parser) took 100457.91 ms. Allocated memory was 144.7 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 101.0 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-18 12:15:35,511 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:15:35,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 815.60 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 155.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:35,512 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.67 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:35,512 INFO L168 Benchmark]: Boogie Preprocessor took 40.35 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:35,513 INFO L168 Benchmark]: RCFGBuilder took 841.79 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 99.0 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:15:35,513 INFO L168 Benchmark]: TraceAbstraction took 98691.14 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-18 12:15:35,516 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 815.60 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 155.1 MB in the end (delta: -54.5 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.67 ms. Allocated memory is still 201.3 MB. Free memory was 155.1 MB in the beginning and 152.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.35 ms. Allocated memory is still 201.3 MB. Free memory was 152.3 MB in the beginning and 149.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 841.79 ms. Allocated memory is still 201.3 MB. Free memory was 149.6 MB in the beginning and 99.0 MB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98691.14 ms. Allocated memory was 201.3 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 98.3 MB in the beginning and 2.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 177 ProgramPointsBefore, 93 ProgramPointsAfterwards, 214 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7398 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 270 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 78628 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t159, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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] [L832] FCALL, FORK 0 pthread_create(&t160, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t161, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L773] 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 [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 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) [L807] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, 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=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 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 [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 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 [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, 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=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 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) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 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 [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.2s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 36.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6030 SDtfs, 10160 SDslu, 17723 SDs, 0 SdLazy, 11335 SolverSat, 725 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 370 GetRequests, 49 SyntacticMatches, 13 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2425 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146095occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 481048 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1112 NumberOfCodeBlocks, 1112 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1020 ConstructedInterpolants, 0 QuantifiedInterpolants, 195277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...