/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:50:09,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:50:09,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:50:09,687 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:50:09,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:50:09,690 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:50:09,692 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:50:09,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:50:09,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:50:09,709 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:50:09,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:50:09,713 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:50:09,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:50:09,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:50:09,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:50:09,719 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:50:09,720 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:50:09,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:50:09,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:50:09,728 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:50:09,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:50:09,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:50:09,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:50:09,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:50:09,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:50:09,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:50:09,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:50:09,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:50:09,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:50:09,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:50:09,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:50:09,747 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:50:09,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:50:09,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:50:09,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:50:09,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:50:09,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:50:09,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:50:09,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:50:09,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:50:09,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:50:09,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:50:09,776 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:50:09,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:50:09,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:50:09,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:50:09,779 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:50:09,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:50:09,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:50:09,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:50:09,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:50:09,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:50:09,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:50:09,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:50:09,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:50:09,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:50:09,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:50:09,784 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:50:09,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:50:09,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:50:09,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:50:09,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:50:09,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:50:09,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:50:09,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:50:09,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:50:09,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:50:09,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:50:09,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:50:09,787 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:50:09,787 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:50:09,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:50:09,788 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:50:09,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:50:10,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:50:10,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:50:10,134 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:50:10,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:50:10,137 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:50:10,137 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.oepc.i [2019-12-27 21:50:10,206 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6e58a54/db1a9d040ea44cdeb4a02b5b5c72254d/FLAG1d92d6cfe [2019-12-27 21:50:10,745 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:50:10,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.oepc.i [2019-12-27 21:50:10,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6e58a54/db1a9d040ea44cdeb4a02b5b5c72254d/FLAG1d92d6cfe [2019-12-27 21:50:11,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6e58a54/db1a9d040ea44cdeb4a02b5b5c72254d [2019-12-27 21:50:11,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:50:11,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:50:11,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:11,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:50:11,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:50:11,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479233c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11, skipping insertion in model container [2019-12-27 21:50:11,093 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:50:11,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:50:11,689 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:11,706 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:50:11,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:50:11,860 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:50:11,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11 WrapperNode [2019-12-27 21:50:11,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:50:11,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:11,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:50:11,862 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:50:11,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:50:11,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:50:11,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:50:11,923 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:50:11,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,961 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... [2019-12-27 21:50:11,966 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:50:11,967 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:50:11,967 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:50:11,967 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:50:11,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:50:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:50:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:50:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:50:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:50:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:50:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:50:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:50:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:50:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:50:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:50:12,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:50:12,035 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:50:12,730 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:50:12,730 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:50:12,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:12 BoogieIcfgContainer [2019-12-27 21:50:12,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:50:12,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:50:12,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:50:12,737 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:50:12,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:50:11" (1/3) ... [2019-12-27 21:50:12,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:12, skipping insertion in model container [2019-12-27 21:50:12,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:50:11" (2/3) ... [2019-12-27 21:50:12,739 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:50:12, skipping insertion in model container [2019-12-27 21:50:12,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:50:12" (3/3) ... [2019-12-27 21:50:12,742 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.oepc.i [2019-12-27 21:50:12,753 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:50:12,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:50:12,766 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:50:12,767 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:50:12,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,826 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,827 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,836 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,875 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,876 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,877 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,878 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,879 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,885 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,890 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,893 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:50:12,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 21:50:12,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:50:12,931 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:50:12,931 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:50:12,931 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:50:12,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:50:12,932 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:50:12,932 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:50:12,932 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:50:12,949 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 21:50:12,951 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:50:13,041 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:50:13,042 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:13,056 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:50:13,076 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 21:50:13,156 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 21:50:13,156 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:50:13,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 21:50:13,184 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 21:50:13,185 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:50:16,271 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 21:50:16,390 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 21:50:16,419 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49085 [2019-12-27 21:50:16,419 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-27 21:50:16,422 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 21:50:16,856 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 21:50:16,859 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 21:50:16,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:50:16,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:16,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:50:16,867 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:16,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:16,873 INFO L82 PathProgramCache]: Analyzing trace with hash 791333, now seen corresponding path program 1 times [2019-12-27 21:50:16,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:16,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390573720] [2019-12-27 21:50:16,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:17,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390573720] [2019-12-27 21:50:17,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:17,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:50:17,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2002278541] [2019-12-27 21:50:17,116 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:17,121 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:17,134 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:50:17,134 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:17,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:17,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:17,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:17,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:17,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:17,159 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 21:50:17,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:17,426 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 21:50:17,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:17,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:50:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:17,511 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 21:50:17,511 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 21:50:17,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:17,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 21:50:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 21:50:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 21:50:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 21:50:18,072 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 21:50:18,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:18,072 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 21:50:18,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:18,073 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 21:50:18,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:50:18,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:18,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:18,076 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash 912855206, now seen corresponding path program 1 times [2019-12-27 21:50:18,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:18,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983707615] [2019-12-27 21:50:18,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:18,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983707615] [2019-12-27 21:50:18,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:18,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:18,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1508726614] [2019-12-27 21:50:18,174 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:18,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:18,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:50:18,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:18,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:18,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:18,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:18,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:18,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:18,183 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 21:50:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:18,225 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 21:50:18,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:18,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 21:50:18,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:18,232 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 21:50:18,232 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 21:50:18,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 21:50:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 21:50:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 21:50:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 21:50:18,271 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 21:50:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:18,271 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 21:50:18,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 21:50:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:50:18,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:18,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:18,279 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:18,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:18,280 INFO L82 PathProgramCache]: Analyzing trace with hash 124584310, now seen corresponding path program 1 times [2019-12-27 21:50:18,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:18,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415453055] [2019-12-27 21:50:18,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:18,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:18,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415453055] [2019-12-27 21:50:18,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:18,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:18,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101286529] [2019-12-27 21:50:18,374 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:18,377 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:18,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:50:18,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:18,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:18,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:18,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:18,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:18,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:18,384 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 21:50:18,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:18,467 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 21:50:18,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:18,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 21:50:18,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:18,481 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 21:50:18,481 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 21:50:18,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:18,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 21:50:18,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 21:50:18,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 21:50:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 21:50:18,529 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 21:50:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:18,529 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 21:50:18,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 21:50:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:50:18,530 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:18,530 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:18,531 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:18,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:18,531 INFO L82 PathProgramCache]: Analyzing trace with hash 35390056, now seen corresponding path program 1 times [2019-12-27 21:50:18,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:18,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604028301] [2019-12-27 21:50:18,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:18,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604028301] [2019-12-27 21:50:18,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:18,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:18,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394876917] [2019-12-27 21:50:18,623 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:18,624 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:18,627 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:50:18,627 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:18,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:18,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:18,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:18,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:18,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:18,629 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 21:50:18,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:18,810 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 21:50:18,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:18,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:50:18,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:18,820 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 21:50:18,820 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 21:50:18,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 21:50:18,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 21:50:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 21:50:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 21:50:18,866 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 21:50:18,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:18,867 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 21:50:18,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:18,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 21:50:18,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 21:50:18,868 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:18,868 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:18,869 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 801099966, now seen corresponding path program 1 times [2019-12-27 21:50:18,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:18,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793356990] [2019-12-27 21:50:18,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:18,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:18,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793356990] [2019-12-27 21:50:18,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:18,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:18,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [567521583] [2019-12-27 21:50:18,944 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:18,946 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:18,948 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 21:50:18,948 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:18,948 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:18,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:18,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:18,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:18,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:18,949 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 21:50:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:19,147 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 21:50:19,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:50:19,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 21:50:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:19,158 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 21:50:19,158 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 21:50:19,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:19,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 21:50:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 21:50:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 21:50:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 21:50:19,201 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 21:50:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:19,201 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 21:50:19,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 21:50:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:50:19,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:19,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:19,204 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:19,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:19,205 INFO L82 PathProgramCache]: Analyzing trace with hash -738044695, now seen corresponding path program 1 times [2019-12-27 21:50:19,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:19,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396892103] [2019-12-27 21:50:19,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:19,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:19,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396892103] [2019-12-27 21:50:19,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:19,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:19,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552094143] [2019-12-27 21:50:19,317 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:19,321 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:19,325 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:50:19,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:19,326 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:19,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:19,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:19,327 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 21:50:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:19,574 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 21:50:19,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:50:19,575 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:50:19,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:19,596 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 21:50:19,597 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 21:50:19,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:50:19,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 21:50:19,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 21:50:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 21:50:19,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 21:50:19,642 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 21:50:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:19,643 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 21:50:19,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:19,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 21:50:19,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:50:19,645 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:19,645 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:19,646 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:19,646 INFO L82 PathProgramCache]: Analyzing trace with hash 602591181, now seen corresponding path program 1 times [2019-12-27 21:50:19,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:19,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218632871] [2019-12-27 21:50:19,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:19,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218632871] [2019-12-27 21:50:19,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:19,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:19,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [840978115] [2019-12-27 21:50:19,697 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:19,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:19,708 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 21:50:19,708 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:19,709 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:19,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:19,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:19,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:19,710 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 21:50:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:19,752 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 21:50:19,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:19,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 21:50:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:19,762 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 21:50:19,762 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 21:50:19,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 21:50:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 21:50:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 21:50:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 21:50:19,811 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 21:50:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:19,811 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 21:50:19,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 21:50:19,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:50:19,814 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:19,814 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] [2019-12-27 21:50:19,814 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:19,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:19,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2104804157, now seen corresponding path program 1 times [2019-12-27 21:50:19,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:19,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904419957] [2019-12-27 21:50:19,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:19,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904419957] [2019-12-27 21:50:19,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:19,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:19,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329077297] [2019-12-27 21:50:19,872 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:19,877 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:19,887 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 21:50:19,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:19,933 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:50:19,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:19,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:19,936 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 5 states. [2019-12-27 21:50:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:19,963 INFO L93 Difference]: Finished difference Result 1053 states and 2169 transitions. [2019-12-27 21:50:19,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:50:19,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:50:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:19,972 INFO L225 Difference]: With dead ends: 1053 [2019-12-27 21:50:19,972 INFO L226 Difference]: Without dead ends: 1053 [2019-12-27 21:50:19,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:19,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-12-27 21:50:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2019-12-27 21:50:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 21:50:20,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2062 transitions. [2019-12-27 21:50:20,048 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2062 transitions. Word has length 26 [2019-12-27 21:50:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:20,048 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2062 transitions. [2019-12-27 21:50:20,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:20,048 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2062 transitions. [2019-12-27 21:50:20,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 21:50:20,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:20,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:20,051 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:20,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash -134458557, now seen corresponding path program 1 times [2019-12-27 21:50:20,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:20,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429905563] [2019-12-27 21:50:20,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:20,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429905563] [2019-12-27 21:50:20,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:20,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:20,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [572053297] [2019-12-27 21:50:20,153 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:20,159 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:20,167 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 21:50:20,168 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:20,169 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:20,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:50:20,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:50:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:20,170 INFO L87 Difference]: Start difference. First operand 995 states and 2062 transitions. Second operand 5 states. [2019-12-27 21:50:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:20,375 INFO L93 Difference]: Finished difference Result 1129 states and 2304 transitions. [2019-12-27 21:50:20,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:50:20,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 21:50:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:20,381 INFO L225 Difference]: With dead ends: 1129 [2019-12-27 21:50:20,381 INFO L226 Difference]: Without dead ends: 1129 [2019-12-27 21:50:20,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:50:20,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-27 21:50:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 904. [2019-12-27 21:50:20,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-12-27 21:50:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1874 transitions. [2019-12-27 21:50:20,404 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1874 transitions. Word has length 26 [2019-12-27 21:50:20,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:20,404 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1874 transitions. [2019-12-27 21:50:20,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:50:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1874 transitions. [2019-12-27 21:50:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:50:20,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:20,407 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:20,408 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:20,408 INFO L82 PathProgramCache]: Analyzing trace with hash 830310095, now seen corresponding path program 1 times [2019-12-27 21:50:20,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:20,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758421598] [2019-12-27 21:50:20,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:20,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:20,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758421598] [2019-12-27 21:50:20,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:20,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:20,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [238048517] [2019-12-27 21:50:20,466 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:20,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:20,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 75 transitions. [2019-12-27 21:50:20,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:20,520 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:50:20,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:20,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:20,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:20,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:20,521 INFO L87 Difference]: Start difference. First operand 904 states and 1874 transitions. Second operand 3 states. [2019-12-27 21:50:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:20,534 INFO L93 Difference]: Finished difference Result 1410 states and 2964 transitions. [2019-12-27 21:50:20,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:20,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:50:20,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:20,536 INFO L225 Difference]: With dead ends: 1410 [2019-12-27 21:50:20,537 INFO L226 Difference]: Without dead ends: 548 [2019-12-27 21:50:20,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:20,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-27 21:50:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-12-27 21:50:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 21:50:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1169 transitions. [2019-12-27 21:50:20,551 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1169 transitions. Word has length 51 [2019-12-27 21:50:20,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:20,552 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1169 transitions. [2019-12-27 21:50:20,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1169 transitions. [2019-12-27 21:50:20,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:50:20,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:20,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:20,557 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:20,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:20,558 INFO L82 PathProgramCache]: Analyzing trace with hash 365260025, now seen corresponding path program 2 times [2019-12-27 21:50:20,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:20,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447640288] [2019-12-27 21:50:20,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:20,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447640288] [2019-12-27 21:50:20,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:20,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:50:20,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [290677494] [2019-12-27 21:50:20,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:20,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:20,847 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 118 states and 183 transitions. [2019-12-27 21:50:20,847 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:20,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:50:20,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 21:50:20,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:20,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 21:50:20,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:50:20,928 INFO L87 Difference]: Start difference. First operand 548 states and 1169 transitions. Second operand 9 states. [2019-12-27 21:50:21,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:21,178 INFO L93 Difference]: Finished difference Result 1122 states and 2322 transitions. [2019-12-27 21:50:21,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:50:21,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 21:50:21,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:21,181 INFO L225 Difference]: With dead ends: 1122 [2019-12-27 21:50:21,181 INFO L226 Difference]: Without dead ends: 775 [2019-12-27 21:50:21,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:50:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-27 21:50:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 613. [2019-12-27 21:50:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-27 21:50:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1276 transitions. [2019-12-27 21:50:21,197 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1276 transitions. Word has length 51 [2019-12-27 21:50:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:21,198 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1276 transitions. [2019-12-27 21:50:21,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 21:50:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1276 transitions. [2019-12-27 21:50:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 21:50:21,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:21,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:21,200 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:21,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash 372470905, now seen corresponding path program 3 times [2019-12-27 21:50:21,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:21,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281094038] [2019-12-27 21:50:21,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:21,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281094038] [2019-12-27 21:50:21,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:21,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:21,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1039679442] [2019-12-27 21:50:21,272 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:21,287 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:21,351 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 125 states and 191 transitions. [2019-12-27 21:50:21,352 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:21,353 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:50:21,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:21,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:21,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:21,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:21,355 INFO L87 Difference]: Start difference. First operand 613 states and 1276 transitions. Second operand 3 states. [2019-12-27 21:50:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:21,423 INFO L93 Difference]: Finished difference Result 758 states and 1575 transitions. [2019-12-27 21:50:21,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:21,423 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 21:50:21,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:21,426 INFO L225 Difference]: With dead ends: 758 [2019-12-27 21:50:21,426 INFO L226 Difference]: Without dead ends: 758 [2019-12-27 21:50:21,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-27 21:50:21,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 670. [2019-12-27 21:50:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-12-27 21:50:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1399 transitions. [2019-12-27 21:50:21,441 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1399 transitions. Word has length 51 [2019-12-27 21:50:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:21,442 INFO L462 AbstractCegarLoop]: Abstraction has 670 states and 1399 transitions. [2019-12-27 21:50:21,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:21,442 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1399 transitions. [2019-12-27 21:50:21,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:50:21,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:21,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:21,444 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:21,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:21,445 INFO L82 PathProgramCache]: Analyzing trace with hash 679432093, now seen corresponding path program 1 times [2019-12-27 21:50:21,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:21,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35960873] [2019-12-27 21:50:21,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:21,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35960873] [2019-12-27 21:50:21,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:21,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 21:50:21,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848034383] [2019-12-27 21:50:21,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:21,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:21,797 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 127 states and 194 transitions. [2019-12-27 21:50:21,798 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:21,916 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 21:50:21,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:50:21,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:50:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:50:21,917 INFO L87 Difference]: Start difference. First operand 670 states and 1399 transitions. Second operand 8 states. [2019-12-27 21:50:22,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:22,672 INFO L93 Difference]: Finished difference Result 1152 states and 2340 transitions. [2019-12-27 21:50:22,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 21:50:22,673 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2019-12-27 21:50:22,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:22,679 INFO L225 Difference]: With dead ends: 1152 [2019-12-27 21:50:22,679 INFO L226 Difference]: Without dead ends: 1128 [2019-12-27 21:50:22,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-27 21:50:22,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2019-12-27 21:50:22,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1039. [2019-12-27 21:50:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-27 21:50:22,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2123 transitions. [2019-12-27 21:50:22,707 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2123 transitions. Word has length 52 [2019-12-27 21:50:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:22,707 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2123 transitions. [2019-12-27 21:50:22,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:50:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2123 transitions. [2019-12-27 21:50:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:50:22,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:22,710 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:22,710 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:22,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:22,711 INFO L82 PathProgramCache]: Analyzing trace with hash 292599181, now seen corresponding path program 1 times [2019-12-27 21:50:22,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:22,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371454811] [2019-12-27 21:50:22,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:22,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371454811] [2019-12-27 21:50:22,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:22,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:50:22,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922980421] [2019-12-27 21:50:22,786 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:22,804 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:22,949 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 104 states and 152 transitions. [2019-12-27 21:50:22,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:22,952 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:50:22,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:50:22,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:22,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:50:22,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:50:22,953 INFO L87 Difference]: Start difference. First operand 1039 states and 2123 transitions. Second operand 4 states. [2019-12-27 21:50:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:23,018 INFO L93 Difference]: Finished difference Result 1019 states and 2070 transitions. [2019-12-27 21:50:23,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:50:23,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-27 21:50:23,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:23,022 INFO L225 Difference]: With dead ends: 1019 [2019-12-27 21:50:23,022 INFO L226 Difference]: Without dead ends: 1019 [2019-12-27 21:50:23,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:50:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-12-27 21:50:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 947. [2019-12-27 21:50:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-12-27 21:50:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1914 transitions. [2019-12-27 21:50:23,043 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1914 transitions. Word has length 52 [2019-12-27 21:50:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:23,043 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1914 transitions. [2019-12-27 21:50:23,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:50:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1914 transitions. [2019-12-27 21:50:23,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 21:50:23,046 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:23,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:23,046 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:23,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash -267803227, now seen corresponding path program 2 times [2019-12-27 21:50:23,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:23,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803968313] [2019-12-27 21:50:23,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:50:23,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:50:23,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803968313] [2019-12-27 21:50:23,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:50:23,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:50:23,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [624564079] [2019-12-27 21:50:23,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:50:23,122 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:50:23,173 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 97 states and 132 transitions. [2019-12-27 21:50:23,173 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:50:23,174 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:50:23,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:50:23,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:50:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:50:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:23,175 INFO L87 Difference]: Start difference. First operand 947 states and 1914 transitions. Second operand 3 states. [2019-12-27 21:50:23,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:50:23,192 INFO L93 Difference]: Finished difference Result 947 states and 1913 transitions. [2019-12-27 21:50:23,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:50:23,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 21:50:23,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:50:23,195 INFO L225 Difference]: With dead ends: 947 [2019-12-27 21:50:23,195 INFO L226 Difference]: Without dead ends: 947 [2019-12-27 21:50:23,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:50:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-27 21:50:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 713. [2019-12-27 21:50:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-27 21:50:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1471 transitions. [2019-12-27 21:50:23,211 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1471 transitions. Word has length 52 [2019-12-27 21:50:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:50:23,212 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1471 transitions. [2019-12-27 21:50:23,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:50:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1471 transitions. [2019-12-27 21:50:23,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 21:50:23,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:50:23,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:50:23,215 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:50:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:50:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1093323660, now seen corresponding path program 1 times [2019-12-27 21:50:23,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:50:23,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837250265] [2019-12-27 21:50:23,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:50:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:50:23,342 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:50:23,342 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:50:23,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_27 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff1~0_22) (= v_~y~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_23| 1)) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= 0 v_~x$w_buff0_used~0_100) (= 0 v_~x$w_buff0~0_23) (= 0 v_~x$r_buff0_thd0~0_19) (= 0 v_~x$r_buff0_thd2~0_78) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1605~0.base_23| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1605~0.base_23|) |v_ULTIMATE.start_main_~#t1605~0.offset_18| 0))) (< 0 |v_#StackHeapBarrier_15|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1605~0.base_23|) 0) (= 0 v_~x$read_delayed~0_6) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1605~0.base_23|) (= v_~x$r_buff1_thd2~0_49 0) (= v_~x$mem_tmp~0_8 0) (= 0 v_~x$r_buff0_thd1~0_27) (= 0 |v_#NULL.base_6|) (= v_~x$r_buff1_thd1~0_21 0) (= v_~x$flush_delayed~0_11 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1605~0.base_23| 4)) (= 0 v_~weak$$choice2~0_35) (= |v_ULTIMATE.start_main_~#t1605~0.offset_18| 0) (= v_~x~0_22 0) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~z~0_8) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$flush_delayed~0=v_~x$flush_delayed~0_11, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ULTIMATE.start_main_~#t1605~0.base=|v_ULTIMATE.start_main_~#t1605~0.base_23|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t1605~0.offset=|v_ULTIMATE.start_main_~#t1605~0.offset_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, #length=|v_#length_19|, ~y~0=v_~y~0_18, ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_16|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_22|, ~x$w_buff1~0=v_~x$w_buff1~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_27, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_22, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_~#t1605~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1605~0.offset, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1606~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1606~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 21:50:23,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L802-1-->L804: Formula: (and (= |v_ULTIMATE.start_main_~#t1606~0.offset_10| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1606~0.base_11|) |v_ULTIMATE.start_main_~#t1606~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11|) 0) (not (= |v_ULTIMATE.start_main_~#t1606~0.base_11| 0)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1606~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1606~0.base_11|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1606~0.base_11| 4) |v_#length_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1606~0.offset=|v_ULTIMATE.start_main_~#t1606~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1606~0.base=|v_ULTIMATE.start_main_~#t1606~0.base_11|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1606~0.offset, ULTIMATE.start_main_~#t1606~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 21:50:23,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~x$r_buff1_thd1~0_Out1624607227 ~x$r_buff0_thd1~0_In1624607227) (= ~x$r_buff1_thd0~0_Out1624607227 ~x$r_buff0_thd0~0_In1624607227) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1624607227)) (= ~x$r_buff1_thd2~0_Out1624607227 ~x$r_buff0_thd2~0_In1624607227) (= ~y~0_Out1624607227 1) (= 1 ~x$r_buff0_thd1~0_Out1624607227)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1624607227, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1624607227, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1624607227, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1624607227} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1624607227, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1624607227, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1624607227, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1624607227, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1624607227, ~y~0=~y~0_Out1624607227, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1624607227, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1624607227} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 21:50:23,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In1860584840 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1860584840 256)))) (or (and (= ~x$w_buff0_used~0_In1860584840 |P0Thread1of1ForFork0_#t~ite5_Out1860584840|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out1860584840|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1860584840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860584840} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1860584840|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1860584840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1860584840} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 21:50:23,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1293529921 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1293529921 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1293529921 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1293529921 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1293529921| ~x$w_buff1_used~0_In-1293529921)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1293529921|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1293529921, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1293529921, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1293529921, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1293529921} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1293529921|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1293529921, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1293529921, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1293529921, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1293529921} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 21:50:23,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1568511121 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In1568511121 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_Out1568511121 ~x$r_buff0_thd1~0_In1568511121)) (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd1~0_Out1568511121)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1568511121, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568511121} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1568511121, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1568511121|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1568511121} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 21:50:23,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In1734762607 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1734762607 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1734762607 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1734762607 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1734762607|)) (and (= ~x$r_buff1_thd1~0_In1734762607 |P0Thread1of1ForFork0_#t~ite8_Out1734762607|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1734762607, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1734762607, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1734762607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734762607} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1734762607, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1734762607|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1734762607, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1734762607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734762607} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 21:50:23,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 21:50:23,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd2~0_53 v_~x$r_buff0_thd2~0_52)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_21, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 21:50:23,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L773-->L773-8: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1847308205 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1847308205 256))) (.cse5 (= 0 (mod ~x$w_buff1_used~0_In1847308205 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd2~0_In1847308205 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite29_Out1847308205| |P1Thread1of1ForFork1_#t~ite30_Out1847308205|)) (.cse1 (= 0 (mod ~weak$$choice2~0_In1847308205 256)))) (or (let ((.cse3 (not .cse6))) (and (not .cse0) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out1847308205| |P1Thread1of1ForFork1_#t~ite28_Out1847308205|) (or (not .cse2) .cse3) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out1847308205|) .cse4 (or .cse3 (not .cse5)))) (and (= |P1Thread1of1ForFork1_#t~ite28_In1847308205| |P1Thread1of1ForFork1_#t~ite28_Out1847308205|) (or (and .cse1 (or (and .cse6 .cse2) .cse0 (and .cse5 .cse6)) .cse4 (= |P1Thread1of1ForFork1_#t~ite29_Out1847308205| ~x$r_buff1_thd2~0_In1847308205)) (and (= ~x$r_buff1_thd2~0_In1847308205 |P1Thread1of1ForFork1_#t~ite30_Out1847308205|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out1847308205| |P1Thread1of1ForFork1_#t~ite29_In1847308205|)))))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In1847308205|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1847308205, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1847308205, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1847308205, ~weak$$choice2~0=~weak$$choice2~0_In1847308205, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In1847308205|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1847308205} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out1847308205|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1847308205|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1847308205, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1847308205, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1847308205, ~weak$$choice2~0=~weak$$choice2~0_In1847308205, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out1847308205|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1847308205} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 21:50:23,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~x$mem_tmp~0_4 v_~x~0_16) (= 0 v_~x$flush_delayed~0_6) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 21:50:23,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In919617644 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In919617644 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out919617644| ~x~0_In919617644) (or .cse0 .cse1)) (and (not .cse1) (= ~x$w_buff1~0_In919617644 |P1Thread1of1ForFork1_#t~ite32_Out919617644|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In919617644, ~x$w_buff1_used~0=~x$w_buff1_used~0_In919617644, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In919617644, ~x~0=~x~0_In919617644} OutVars{~x$w_buff1~0=~x$w_buff1~0_In919617644, ~x$w_buff1_used~0=~x$w_buff1_used~0_In919617644, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In919617644, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out919617644|, ~x~0=~x~0_In919617644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 21:50:23,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 21:50:23,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-696627001 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-696627001 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-696627001| 0)) (and (= ~x$w_buff0_used~0_In-696627001 |P1Thread1of1ForFork1_#t~ite34_Out-696627001|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-696627001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-696627001} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-696627001|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-696627001, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-696627001} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 21:50:23,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In542041791 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In542041791 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In542041791 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In542041791 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out542041791|)) (and (= ~x$w_buff1_used~0_In542041791 |P1Thread1of1ForFork1_#t~ite35_Out542041791|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In542041791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542041791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542041791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542041791} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In542041791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542041791, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out542041791|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542041791, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542041791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 21:50:23,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1562582470 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1562582470 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1562582470| ~x$r_buff0_thd2~0_In-1562582470)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1562582470|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1562582470, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1562582470} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1562582470, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1562582470|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1562582470} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 21:50:23,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-766187171 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-766187171 256))) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-766187171 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-766187171 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-766187171| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-766187171| ~x$r_buff1_thd2~0_In-766187171)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-766187171, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-766187171, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-766187171, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766187171} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-766187171, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-766187171, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-766187171, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-766187171|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-766187171} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:50:23,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 21:50:23,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 21:50:23,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In274870486 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In274870486 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite41_Out274870486| |ULTIMATE.start_main_#t~ite40_Out274870486|))) (or (and (= ~x~0_In274870486 |ULTIMATE.start_main_#t~ite40_Out274870486|) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) (= ~x$w_buff1~0_In274870486 |ULTIMATE.start_main_#t~ite40_Out274870486|) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In274870486, ~x$w_buff1_used~0=~x$w_buff1_used~0_In274870486, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In274870486, ~x~0=~x~0_In274870486} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out274870486|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out274870486|, ~x$w_buff1~0=~x$w_buff1~0_In274870486, ~x$w_buff1_used~0=~x$w_buff1_used~0_In274870486, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In274870486, ~x~0=~x~0_In274870486} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 21:50:23,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In82270965 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In82270965 256)))) (or (and (= ~x$w_buff0_used~0_In82270965 |ULTIMATE.start_main_#t~ite42_Out82270965|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out82270965|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In82270965, ~x$w_buff0_used~0=~x$w_buff0_used~0_In82270965} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In82270965, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out82270965|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In82270965} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 21:50:23,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1775284693 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1775284693 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1775284693 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1775284693 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1775284693| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1775284693| ~x$w_buff1_used~0_In1775284693) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1775284693, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1775284693, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1775284693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1775284693} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1775284693, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1775284693, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1775284693|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1775284693, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1775284693} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 21:50:23,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-488423773 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-488423773 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-488423773|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-488423773 |ULTIMATE.start_main_#t~ite44_Out-488423773|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-488423773, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-488423773} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-488423773, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-488423773|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-488423773} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 21:50:23,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1434888566 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1434888566 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1434888566 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1434888566 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1434888566| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out1434888566| ~x$r_buff1_thd0~0_In1434888566) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1434888566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1434888566, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1434888566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1434888566} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1434888566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1434888566, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1434888566, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1434888566|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1434888566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 21:50:23,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite45_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:50:23,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:50:23 BasicIcfg [2019-12-27 21:50:23,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:50:23,445 INFO L168 Benchmark]: Toolchain (without parser) took 12356.78 ms. Allocated memory was 147.8 MB in the beginning and 447.2 MB in the end (delta: 299.4 MB). Free memory was 104.1 MB in the beginning and 114.4 MB in the end (delta: -10.3 MB). Peak memory consumption was 289.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:23,446 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 21:50:23,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.24 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.9 MB in the beginning and 158.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:23,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.85 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:23,448 INFO L168 Benchmark]: Boogie Preprocessor took 44.14 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:23,449 INFO L168 Benchmark]: RCFGBuilder took 765.33 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 108.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:23,450 INFO L168 Benchmark]: TraceAbstraction took 10706.45 ms. Allocated memory was 203.9 MB in the beginning and 447.2 MB in the end (delta: 243.3 MB). Free memory was 108.7 MB in the beginning and 114.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 237.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:50:23,454 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.24 ms. Allocated memory is still 147.8 MB. Free memory was 124.1 MB in the beginning and 123.9 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.24 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 103.9 MB in the beginning and 158.3 MB in the end (delta: -54.3 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.85 ms. Allocated memory is still 203.9 MB. Free memory was 158.3 MB in the beginning and 155.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.14 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 765.33 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 108.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10706.45 ms. Allocated memory was 203.9 MB in the beginning and 447.2 MB in the end (delta: 243.3 MB). Free memory was 108.7 MB in the beginning and 114.4 MB in the end (delta: -5.8 MB). Peak memory consumption was 237.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 26 ChoiceCompositions, 4391 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49085 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1605, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1606, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.4s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1694 SDtfs, 1254 SDslu, 2934 SDs, 0 SdLazy, 1521 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 13 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 2723 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 53664 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...