/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:06:19,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:06:19,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:06:19,775 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:06:19,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:06:19,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:06:19,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:06:19,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:06:19,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:06:19,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:06:19,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:06:19,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:06:19,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:06:19,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:06:19,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:06:19,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:06:19,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:06:19,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:06:19,792 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:06:19,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:06:19,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:06:19,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:06:19,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:06:19,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:06:19,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:06:19,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:06:19,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:06:19,802 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:06:19,802 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:06:19,803 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:06:19,804 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:06:19,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:06:19,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:06:19,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:06:19,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:06:19,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:06:19,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:06:19,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:06:19,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:06:19,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:06:19,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:06:19,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:06:19,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:06:19,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:06:19,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:06:19,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:06:19,841 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:06:19,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:06:19,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:06:19,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:06:19,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:06:19,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:06:19,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:06:19,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:06:19,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:06:19,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:06:19,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:06:19,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:06:19,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:06:19,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:06:19,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:06:19,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:06:19,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:06:19,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:06:19,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:06:19,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:06:19,846 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:06:19,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:06:19,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:06:19,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:06:19,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:06:20,114 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:06:20,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:06:20,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:06:20,133 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:06:20,133 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:06:20,134 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-18 18:06:20,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e0b536f/be22bc1b86304a0b8c94774709417c01/FLAG7e21bc0a4 [2019-12-18 18:06:20,746 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:06:20,747 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_power.oepc.i [2019-12-18 18:06:20,769 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e0b536f/be22bc1b86304a0b8c94774709417c01/FLAG7e21bc0a4 [2019-12-18 18:06:21,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e0b536f/be22bc1b86304a0b8c94774709417c01 [2019-12-18 18:06:21,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:06:21,033 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:06:21,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:06:21,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:06:21,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:06:21,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6968dd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21, skipping insertion in model container [2019-12-18 18:06:21,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:06:21,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:06:21,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:06:21,688 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:06:21,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:06:21,833 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:06:21,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21 WrapperNode [2019-12-18 18:06:21,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:06:21,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:06:21,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:06:21,835 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:06:21,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:06:21,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:06:21,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:06:21,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:06:21,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... [2019-12-18 18:06:21,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:06:21,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:06:21,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:06:21,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:06:21,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:06:22,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:06:22,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:06:22,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:06:22,020 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:06:22,020 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:06:22,021 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:06:22,021 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:06:22,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:06:22,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:06:22,026 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:06:22,732 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:06:22,733 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:06:22,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:06:22 BoogieIcfgContainer [2019-12-18 18:06:22,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:06:22,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:06:22,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:06:22,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:06:22,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:06:21" (1/3) ... [2019-12-18 18:06:22,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f11b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:06:22, skipping insertion in model container [2019-12-18 18:06:22,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:06:21" (2/3) ... [2019-12-18 18:06:22,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f11b97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:06:22, skipping insertion in model container [2019-12-18 18:06:22,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:06:22" (3/3) ... [2019-12-18 18:06:22,743 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_power.oepc.i [2019-12-18 18:06:22,753 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:06:22,754 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:06:22,762 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:06:22,763 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:06:22,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,825 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,826 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,837 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,838 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:06:22,880 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 18:06:22,899 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:06:22,899 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:06:22,899 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:06:22,899 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:06:22,900 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:06:22,900 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:06:22,900 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:06:22,900 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:06:22,916 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 18:06:22,918 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 18:06:22,988 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 18:06:22,989 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:06:23,002 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 18:06:23,019 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 18:06:23,056 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 18:06:23,057 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:06:23,063 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 18:06:23,076 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 18:06:23,077 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:06:27,608 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 18:06:27,740 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 18:06:27,809 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-18 18:06:27,809 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-18 18:06:27,813 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-18 18:06:28,156 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-18 18:06:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-18 18:06:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:06:28,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:28,167 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:06:28,167 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:28,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:28,174 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-18 18:06:28,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:28,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568400350] [2019-12-18 18:06:28,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:28,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568400350] [2019-12-18 18:06:28,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:28,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:06:28,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875414377] [2019-12-18 18:06:28,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:06:28,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:06:28,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:06:28,418 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-18 18:06:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:28,677 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-18 18:06:28,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:06:28,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:06:28,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:28,748 INFO L225 Difference]: With dead ends: 6636 [2019-12-18 18:06:28,748 INFO L226 Difference]: Without dead ends: 6246 [2019-12-18 18:06:28,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:06:28,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-18 18:06:29,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-18 18:06:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-18 18:06:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-18 18:06:29,120 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-18 18:06:29,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:29,120 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-18 18:06:29,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:06:29,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-18 18:06:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:06:29,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:29,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:29,136 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:29,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:29,137 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-18 18:06:29,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:29,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580504303] [2019-12-18 18:06:29,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:29,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580504303] [2019-12-18 18:06:29,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:29,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:06:29,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111902850] [2019-12-18 18:06:29,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:06:29,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:29,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:06:29,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:06:29,328 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-18 18:06:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:29,740 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-12-18 18:06:29,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:06:29,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:06:29,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:29,829 INFO L225 Difference]: With dead ends: 9424 [2019-12-18 18:06:29,829 INFO L226 Difference]: Without dead ends: 9411 [2019-12-18 18:06:29,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:29,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-12-18 18:06:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-12-18 18:06:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-12-18 18:06:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-12-18 18:06:30,159 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-12-18 18:06:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-12-18 18:06:30,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:06:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-12-18 18:06:30,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:06:30,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:30,163 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:30,164 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:30,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:30,164 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-18 18:06:30,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:30,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439357444] [2019-12-18 18:06:30,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:30,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:30,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439357444] [2019-12-18 18:06:30,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:30,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:06:30,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089146471] [2019-12-18 18:06:30,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:06:30,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:06:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:06:30,266 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 3 states. [2019-12-18 18:06:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:30,493 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-12-18 18:06:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:06:30,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 18:06:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:30,537 INFO L225 Difference]: With dead ends: 11392 [2019-12-18 18:06:30,537 INFO L226 Difference]: Without dead ends: 11392 [2019-12-18 18:06:30,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:06:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-12-18 18:06:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-12-18 18:06:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-12-18 18:06:30,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-12-18 18:06:30,893 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-12-18 18:06:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:30,895 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-12-18 18:06:30,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:06:30,895 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-12-18 18:06:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:06:30,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:30,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:30,898 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:30,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-18 18:06:30,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:30,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880430527] [2019-12-18 18:06:30,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:30,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:30,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880430527] [2019-12-18 18:06:30,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:30,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:06:30,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156486976] [2019-12-18 18:06:30,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:06:30,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:30,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:06:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:06:30,984 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 4 states. [2019-12-18 18:06:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:31,233 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-12-18 18:06:31,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:06:31,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:06:31,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:31,272 INFO L225 Difference]: With dead ends: 12648 [2019-12-18 18:06:31,272 INFO L226 Difference]: Without dead ends: 12637 [2019-12-18 18:06:31,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-12-18 18:06:32,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-12-18 18:06:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-12-18 18:06:32,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-12-18 18:06:32,287 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-12-18 18:06:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:32,288 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-12-18 18:06:32,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:06:32,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-12-18 18:06:32,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 18:06:32,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:32,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:32,291 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:32,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:32,292 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-18 18:06:32,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:32,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640198735] [2019-12-18 18:06:32,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:32,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640198735] [2019-12-18 18:06:32,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:32,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:06:32,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421920898] [2019-12-18 18:06:32,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:06:32,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:32,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:06:32,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:06:32,341 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 4 states. [2019-12-18 18:06:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:32,567 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-12-18 18:06:32,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:06:32,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 18:06:32,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:32,601 INFO L225 Difference]: With dead ends: 13620 [2019-12-18 18:06:32,601 INFO L226 Difference]: Without dead ends: 13607 [2019-12-18 18:06:32,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-18 18:06:33,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-12-18 18:06:33,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-12-18 18:06:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-12-18 18:06:33,046 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-12-18 18:06:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:33,047 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-12-18 18:06:33,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:06:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-12-18 18:06:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 18:06:33,052 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:33,052 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:33,052 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:33,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:33,053 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-12-18 18:06:33,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:33,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470652544] [2019-12-18 18:06:33,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:33,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470652544] [2019-12-18 18:06:33,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:33,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:06:33,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480346416] [2019-12-18 18:06:33,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:06:33,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:33,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:06:33,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:06:33,100 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 3 states. [2019-12-18 18:06:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:33,154 INFO L93 Difference]: Finished difference Result 11464 states and 37241 transitions. [2019-12-18 18:06:33,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:06:33,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 18:06:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:33,180 INFO L225 Difference]: With dead ends: 11464 [2019-12-18 18:06:33,181 INFO L226 Difference]: Without dead ends: 11464 [2019-12-18 18:06:33,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:06:33,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11464 states. [2019-12-18 18:06:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11464 to 11464. [2019-12-18 18:06:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11464 states. [2019-12-18 18:06:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11464 states to 11464 states and 37241 transitions. [2019-12-18 18:06:33,493 INFO L78 Accepts]: Start accepts. Automaton has 11464 states and 37241 transitions. Word has length 16 [2019-12-18 18:06:33,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:33,494 INFO L462 AbstractCegarLoop]: Abstraction has 11464 states and 37241 transitions. [2019-12-18 18:06:33,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:06:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 11464 states and 37241 transitions. [2019-12-18 18:06:33,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 18:06:33,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:33,509 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:33,509 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:33,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:33,510 INFO L82 PathProgramCache]: Analyzing trace with hash 89165451, now seen corresponding path program 1 times [2019-12-18 18:06:33,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:33,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931815366] [2019-12-18 18:06:33,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:33,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931815366] [2019-12-18 18:06:33,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:33,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:06:33,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401491019] [2019-12-18 18:06:33,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:06:33,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:06:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:06:33,587 INFO L87 Difference]: Start difference. First operand 11464 states and 37241 transitions. Second operand 3 states. [2019-12-18 18:06:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:33,642 INFO L93 Difference]: Finished difference Result 10861 states and 34721 transitions. [2019-12-18 18:06:33,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:06:33,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-18 18:06:33,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:33,661 INFO L225 Difference]: With dead ends: 10861 [2019-12-18 18:06:33,661 INFO L226 Difference]: Without dead ends: 10861 [2019-12-18 18:06:33,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-18 18:06:33,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2019-12-18 18:06:34,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10663. [2019-12-18 18:06:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10663 states. [2019-12-18 18:06:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10663 states to 10663 states and 34123 transitions. [2019-12-18 18:06:34,072 INFO L78 Accepts]: Start accepts. Automaton has 10663 states and 34123 transitions. Word has length 17 [2019-12-18 18:06:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:34,073 INFO L462 AbstractCegarLoop]: Abstraction has 10663 states and 34123 transitions. [2019-12-18 18:06:34,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:06:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 10663 states and 34123 transitions. [2019-12-18 18:06:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 18:06:34,081 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:34,081 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:34,082 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:34,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:34,082 INFO L82 PathProgramCache]: Analyzing trace with hash -832349724, now seen corresponding path program 1 times [2019-12-18 18:06:34,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:34,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222301493] [2019-12-18 18:06:34,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:34,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:34,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:34,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222301493] [2019-12-18 18:06:34,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:34,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:06:34,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091384998] [2019-12-18 18:06:34,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:06:34,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:34,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:06:34,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:06:34,148 INFO L87 Difference]: Start difference. First operand 10663 states and 34123 transitions. Second operand 4 states. [2019-12-18 18:06:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:34,183 INFO L93 Difference]: Finished difference Result 2208 states and 5787 transitions. [2019-12-18 18:06:34,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:06:34,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-18 18:06:34,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:34,186 INFO L225 Difference]: With dead ends: 2208 [2019-12-18 18:06:34,186 INFO L226 Difference]: Without dead ends: 1576 [2019-12-18 18:06:34,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:34,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-12-18 18:06:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-12-18 18:06:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-12-18 18:06:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3757 transitions. [2019-12-18 18:06:34,212 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3757 transitions. Word has length 18 [2019-12-18 18:06:34,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:34,213 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 3757 transitions. [2019-12-18 18:06:34,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:06:34,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3757 transitions. [2019-12-18 18:06:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 18:06:34,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:34,216 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-18 18:06:34,216 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:34,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-18 18:06:34,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:34,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446466161] [2019-12-18 18:06:34,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:34,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446466161] [2019-12-18 18:06:34,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:34,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:06:34,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917212533] [2019-12-18 18:06:34,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:06:34,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:34,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:06:34,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:34,278 INFO L87 Difference]: Start difference. First operand 1576 states and 3757 transitions. Second operand 5 states. [2019-12-18 18:06:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:34,526 INFO L93 Difference]: Finished difference Result 2187 states and 5165 transitions. [2019-12-18 18:06:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:06:34,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 18:06:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:34,529 INFO L225 Difference]: With dead ends: 2187 [2019-12-18 18:06:34,529 INFO L226 Difference]: Without dead ends: 2185 [2019-12-18 18:06:34,530 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-18 18:06:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2019-12-18 18:06:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1686. [2019-12-18 18:06:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1686 states. [2019-12-18 18:06:34,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1686 states to 1686 states and 4016 transitions. [2019-12-18 18:06:34,561 INFO L78 Accepts]: Start accepts. Automaton has 1686 states and 4016 transitions. Word has length 26 [2019-12-18 18:06:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:34,562 INFO L462 AbstractCegarLoop]: Abstraction has 1686 states and 4016 transitions. [2019-12-18 18:06:34,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:06:34,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1686 states and 4016 transitions. [2019-12-18 18:06:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:06:34,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:34,566 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:34,566 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-12-18 18:06:34,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:34,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927529410] [2019-12-18 18:06:34,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:34,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:34,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927529410] [2019-12-18 18:06:34,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:34,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:06:34,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613797426] [2019-12-18 18:06:34,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:06:34,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:34,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:06:34,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:34,635 INFO L87 Difference]: Start difference. First operand 1686 states and 4016 transitions. Second operand 5 states. [2019-12-18 18:06:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:34,896 INFO L93 Difference]: Finished difference Result 2156 states and 5083 transitions. [2019-12-18 18:06:34,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 18:06:34,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 18:06:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:34,900 INFO L225 Difference]: With dead ends: 2156 [2019-12-18 18:06:34,900 INFO L226 Difference]: Without dead ends: 2154 [2019-12-18 18:06:34,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:06:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2154 states. [2019-12-18 18:06:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2154 to 1596. [2019-12-18 18:06:34,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2019-12-18 18:06:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 3807 transitions. [2019-12-18 18:06:34,928 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 3807 transitions. Word has length 27 [2019-12-18 18:06:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:34,928 INFO L462 AbstractCegarLoop]: Abstraction has 1596 states and 3807 transitions. [2019-12-18 18:06:34,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:06:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 3807 transitions. [2019-12-18 18:06:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 18:06:34,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:34,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:06:34,932 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:34,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:34,932 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-12-18 18:06:34,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:34,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059614069] [2019-12-18 18:06:34,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:35,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:35,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059614069] [2019-12-18 18:06:35,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:35,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:06:35,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101956742] [2019-12-18 18:06:35,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:06:35,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:35,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:06:35,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:35,069 INFO L87 Difference]: Start difference. First operand 1596 states and 3807 transitions. Second operand 5 states. [2019-12-18 18:06:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:35,134 INFO L93 Difference]: Finished difference Result 791 states and 1818 transitions. [2019-12-18 18:06:35,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:06:35,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 18:06:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:35,137 INFO L225 Difference]: With dead ends: 791 [2019-12-18 18:06:35,137 INFO L226 Difference]: Without dead ends: 716 [2019-12-18 18:06:35,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:06:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2019-12-18 18:06:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2019-12-18 18:06:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-12-18 18:06:35,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1637 transitions. [2019-12-18 18:06:35,154 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1637 transitions. Word has length 27 [2019-12-18 18:06:35,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:35,154 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 1637 transitions. [2019-12-18 18:06:35,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:06:35,155 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1637 transitions. [2019-12-18 18:06:35,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 18:06:35,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:35,158 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] [2019-12-18 18:06:35,159 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:35,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:35,159 INFO L82 PathProgramCache]: Analyzing trace with hash 394366268, now seen corresponding path program 1 times [2019-12-18 18:06:35,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:35,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347158722] [2019-12-18 18:06:35,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:35,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:35,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347158722] [2019-12-18 18:06:35,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:35,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:06:35,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450626570] [2019-12-18 18:06:35,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:06:35,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:06:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:06:35,247 INFO L87 Difference]: Start difference. First operand 716 states and 1637 transitions. Second operand 6 states. [2019-12-18 18:06:35,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:35,594 INFO L93 Difference]: Finished difference Result 1836 states and 4152 transitions. [2019-12-18 18:06:35,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 18:06:35,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-18 18:06:35,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:35,597 INFO L225 Difference]: With dead ends: 1836 [2019-12-18 18:06:35,597 INFO L226 Difference]: Without dead ends: 1248 [2019-12-18 18:06:35,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:06:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-18 18:06:35,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 788. [2019-12-18 18:06:35,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2019-12-18 18:06:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1805 transitions. [2019-12-18 18:06:35,612 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1805 transitions. Word has length 42 [2019-12-18 18:06:35,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:35,612 INFO L462 AbstractCegarLoop]: Abstraction has 788 states and 1805 transitions. [2019-12-18 18:06:35,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:06:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1805 transitions. [2019-12-18 18:06:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 18:06:35,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:35,615 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] [2019-12-18 18:06:35,616 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash -186633826, now seen corresponding path program 2 times [2019-12-18 18:06:35,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:35,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873110983] [2019-12-18 18:06:35,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:35,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:35,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:35,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873110983] [2019-12-18 18:06:35,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:35,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:06:35,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4360951] [2019-12-18 18:06:35,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:06:35,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:35,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:06:35,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:06:35,682 INFO L87 Difference]: Start difference. First operand 788 states and 1805 transitions. Second operand 4 states. [2019-12-18 18:06:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:35,705 INFO L93 Difference]: Finished difference Result 1266 states and 2914 transitions. [2019-12-18 18:06:35,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:06:35,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-18 18:06:35,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:35,707 INFO L225 Difference]: With dead ends: 1266 [2019-12-18 18:06:35,707 INFO L226 Difference]: Without dead ends: 498 [2019-12-18 18:06:35,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:06:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-18 18:06:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 498. [2019-12-18 18:06:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-18 18:06:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1142 transitions. [2019-12-18 18:06:35,717 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1142 transitions. Word has length 42 [2019-12-18 18:06:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:35,717 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1142 transitions. [2019-12-18 18:06:35,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:06:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1142 transitions. [2019-12-18 18:06:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 18:06:35,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:35,720 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] [2019-12-18 18:06:35,720 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:35,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:35,721 INFO L82 PathProgramCache]: Analyzing trace with hash 380081836, now seen corresponding path program 3 times [2019-12-18 18:06:35,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:35,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845529522] [2019-12-18 18:06:35,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:35,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:06:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:06:35,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845529522] [2019-12-18 18:06:35,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:06:35,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 18:06:35,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614460595] [2019-12-18 18:06:35,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 18:06:35,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:06:35,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 18:06:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 18:06:35,804 INFO L87 Difference]: Start difference. First operand 498 states and 1142 transitions. Second operand 7 states. [2019-12-18 18:06:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:06:36,013 INFO L93 Difference]: Finished difference Result 866 states and 1944 transitions. [2019-12-18 18:06:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 18:06:36,014 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-18 18:06:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:06:36,015 INFO L225 Difference]: With dead ends: 866 [2019-12-18 18:06:36,015 INFO L226 Difference]: Without dead ends: 580 [2019-12-18 18:06:36,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 18:06:36,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-12-18 18:06:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 514. [2019-12-18 18:06:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 514 states. [2019-12-18 18:06:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1172 transitions. [2019-12-18 18:06:36,024 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1172 transitions. Word has length 42 [2019-12-18 18:06:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:06:36,024 INFO L462 AbstractCegarLoop]: Abstraction has 514 states and 1172 transitions. [2019-12-18 18:06:36,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 18:06:36,025 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1172 transitions. [2019-12-18 18:06:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 18:06:36,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:06:36,026 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] [2019-12-18 18:06:36,027 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:06:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:06:36,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 4 times [2019-12-18 18:06:36,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:06:36,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922164448] [2019-12-18 18:06:36,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:06:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:06:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:06:36,178 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:06:36,178 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:06:36,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1649~0.base_19|) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1649~0.base_19|)) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 |v_ULTIMATE.start_main_~#t1649~0.offset_17|) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1649~0.base_19| 1) |v_#valid_38|) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1649~0.base_19| 4)) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= v_~y$r_buff0_thd0~0_127 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1649~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1649~0.base_19|) |v_ULTIMATE.start_main_~#t1649~0.offset_17| 0)) |v_#memory_int_11|) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, ULTIMATE.start_main_~#t1650~0.offset=|v_ULTIMATE.start_main_~#t1650~0.offset_17|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_~#t1649~0.offset=|v_ULTIMATE.start_main_~#t1649~0.offset_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, ULTIMATE.start_main_~#t1649~0.base=|v_ULTIMATE.start_main_~#t1649~0.base_19|, #valid=|v_#valid_38|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t1650~0.base=|v_ULTIMATE.start_main_~#t1650~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_~#t1650~0.offset, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_~#t1649~0.offset, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t1649~0.base, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1650~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 18:06:36,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1650~0.base_9| 4)) (not (= |v_ULTIMATE.start_main_~#t1650~0.base_9| 0)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1650~0.base_9|) 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1650~0.base_9| 1)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1650~0.base_9|) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1650~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1650~0.base_9|) |v_ULTIMATE.start_main_~#t1650~0.offset_8| 1)) |v_#memory_int_7|) (= |v_ULTIMATE.start_main_~#t1650~0.offset_8| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1650~0.offset=|v_ULTIMATE.start_main_~#t1650~0.offset_8|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1650~0.base=|v_ULTIMATE.start_main_~#t1650~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1650~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1650~0.base] because there is no mapped edge [2019-12-18 18:06:36,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76 0)) (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 18:06:36,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In912435465 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In912435465 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out912435465|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In912435465 |P1Thread1of1ForFork0_#t~ite28_Out912435465|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In912435465, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In912435465} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In912435465, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In912435465, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out912435465|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 18:06:36,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1564202885 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1564202885 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1564202885 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1564202885 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-1564202885 |P1Thread1of1ForFork0_#t~ite29_Out-1564202885|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1564202885|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1564202885, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1564202885, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1564202885, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1564202885} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1564202885, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1564202885, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1564202885, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1564202885|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1564202885} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 18:06:36,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-735646373 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-735646373 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-735646373) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In-735646373 ~y$r_buff0_thd2~0_Out-735646373)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-735646373, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-735646373} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-735646373, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-735646373|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-735646373} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:06:36,194 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-891714517 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-891714517 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-891714517 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-891714517 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-891714517 256))))) (= |P0Thread1of1ForFork1_#t~ite17_Out-891714517| |P0Thread1of1ForFork1_#t~ite18_Out-891714517|) (= ~y$w_buff1_used~0_In-891714517 |P0Thread1of1ForFork1_#t~ite17_Out-891714517|)) (and (= ~y$w_buff1_used~0_In-891714517 |P0Thread1of1ForFork1_#t~ite18_Out-891714517|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite17_In-891714517| |P0Thread1of1ForFork1_#t~ite17_Out-891714517|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-891714517, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-891714517, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-891714517, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In-891714517|, ~weak$$choice2~0=~weak$$choice2~0_In-891714517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-891714517} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-891714517, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-891714517, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-891714517, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out-891714517|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out-891714517|, ~weak$$choice2~0=~weak$$choice2~0_In-891714517, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-891714517} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 18:06:36,195 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_14|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:06:36,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 18:06:36,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2143567911 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In2143567911 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2143567911 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In2143567911 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out2143567911| ~y$r_buff1_thd2~0_In2143567911)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite31_Out2143567911| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2143567911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2143567911, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2143567911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2143567911} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2143567911, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2143567911, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out2143567911|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2143567911, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2143567911} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 18:06:36,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_34| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 18:06:36,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 18:06:36,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-96869225 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-96869225 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-96869225 |ULTIMATE.start_main_#t~ite34_Out-96869225|)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In-96869225 |ULTIMATE.start_main_#t~ite34_Out-96869225|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-96869225, ~y~0=~y~0_In-96869225, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-96869225, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96869225} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-96869225, ~y~0=~y~0_In-96869225, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-96869225, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-96869225|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-96869225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 18:06:36,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 18:06:36,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2130006659 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2130006659 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-2130006659| ~y$w_buff0_used~0_In-2130006659)) (and (= |ULTIMATE.start_main_#t~ite36_Out-2130006659| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130006659, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2130006659} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2130006659, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2130006659, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2130006659|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 18:06:36,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In328126092 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In328126092 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In328126092 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In328126092 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In328126092 |ULTIMATE.start_main_#t~ite37_Out328126092|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite37_Out328126092|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In328126092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In328126092, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In328126092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In328126092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In328126092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In328126092, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out328126092|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In328126092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In328126092} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 18:06:36,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In147764033 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In147764033 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite38_Out147764033|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In147764033 |ULTIMATE.start_main_#t~ite38_Out147764033|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In147764033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In147764033} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In147764033, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In147764033, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out147764033|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 18:06:36,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1957737235 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1957737235 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1957737235 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1957737235 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out1957737235| ~y$r_buff1_thd0~0_In1957737235)) (and (= |ULTIMATE.start_main_#t~ite39_Out1957737235| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1957737235, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1957737235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1957737235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1957737235} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1957737235, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1957737235|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1957737235, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1957737235, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1957737235} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 18:06:36,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:06:36,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:06:36 BasicIcfg [2019-12-18 18:06:36,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:06:36,299 INFO L168 Benchmark]: Toolchain (without parser) took 15266.89 ms. Allocated memory was 145.2 MB in the beginning and 729.8 MB in the end (delta: 584.6 MB). Free memory was 102.0 MB in the beginning and 430.7 MB in the end (delta: -328.7 MB). Peak memory consumption was 255.9 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:36,300 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:06:36,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.08 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 155.4 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:36,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.85 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:36,303 INFO L168 Benchmark]: Boogie Preprocessor took 51.05 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:36,304 INFO L168 Benchmark]: RCFGBuilder took 789.51 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 109.3 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:36,305 INFO L168 Benchmark]: TraceAbstraction took 13561.83 ms. Allocated memory was 202.4 MB in the beginning and 729.8 MB in the end (delta: 527.4 MB). Free memory was 108.7 MB in the beginning and 430.7 MB in the end (delta: -322.0 MB). Peak memory consumption was 205.4 MB. Max. memory is 7.1 GB. [2019-12-18 18:06:36,314 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.08 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.6 MB in the beginning and 155.4 MB in the end (delta: -53.7 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.85 ms. Allocated memory is still 202.4 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.05 ms. Allocated memory is still 202.4 MB. Free memory was 152.7 MB in the beginning and 150.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 789.51 ms. Allocated memory is still 202.4 MB. Free memory was 150.6 MB in the beginning and 109.3 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13561.83 ms. Allocated memory was 202.4 MB in the beginning and 729.8 MB in the end (delta: 527.4 MB). Free memory was 108.7 MB in the beginning and 430.7 MB in the end (delta: -322.0 MB). Peak memory consumption was 205.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1649, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1650, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1597 SDtfs, 1450 SDslu, 2767 SDs, 0 SdLazy, 1018 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 7202 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 23203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...